检索结果 - "Computational complexity."

Structure-oriented evaluation an evaluation approach for complex processes and systems 由 Tudevdagva, Uranchimeg

Available for University of the Philippines Diliman via SpringerLink. Click here to access
Also available remotely for University of the Philippines Diliman via SpringerLink. Click here to access thru EZproxy

Complex networks & their applications IX proceedings of the ninth international conference on complex networks and their applications complex networks 2020

Also available remotely for the University of the Philippines System via SpringerLink. Click here to access thru EZproxy
Available for University of the Philippines System via SpringerLink. Click here to access

Complex networks & their applications IX proceedings of the ninth international conference on complex networks and their applications complex networks 2020

Also available remotely for the University of the Philippines System via SpringerLink. Click here to access thru EZproxy
Available for University of the Philippines System via SpringerLink. Click here to access

Neural network design and the complexity of learning 由 Judd, J. Stephen

获取全文
获取全文

An approximation result for a duo-processor task scheduling problem. 由 Olmo, P. Dell

Complex systems design & management proceedings of the ninth international conference on complex systems design & management, CSD&M Paris 2018

Available for University of the Philippines Diliman via SpringerLink. Click here to access
Also available remotely for University of the Philippines Diliman via SpringerLink. Click here to access thru EZproxy

Computational theories of interaction and agency

Click here to access thru EZproxy
Click here to access

Synergetic cities information, steady state and phase transition : implications to urban scaling, smart cities and planning 由 Haken, H., Portugali, Juval

Available for University of the Philippines System via SpringerLink. Click here to access
Also available remotely for the University of the Philippines System via SpringerLink. Click here to access thru EZproxy

Efficient checking of polynomials and proofs and the hardness of approximation problems 由 Sudan, Madhu

Circuit complexity and neural networks 由 Parberry, Ian