OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}

Filter by

  • Publication Year
  • Availability
  • Attachment
  • Collection Type
  • General Material Designation
    See More
  • Location
  • Language
Found 7 from your keywords: subject="Computational complex...
cover
Explaining the computational mind
Comment Share
Mi?kowski, Marcin,

In this work, Marcin Milkowski argues that the mind can be explained computationally because it is itself computational - whether it engages in mental arithmetic, parses natural language, or processes the auditory signals that allow us to experience music.OCLC-licensed vendor bibliographic record.

Edition
-
ISBN/ISSN
9780262313919
Collation
1 online resource (x, 243 pages)
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Neural network design and the complexity of learning
Comment Share
Judd, J. Stephen.

"A Bradford book.""Using the tools of complexity theory, Stephen Judd develops a formal description of associative learning in connectionist networks. He rigorously exposes the computational difficulties in training neural networks and explores how certain design principles will or will not make the problems easier. Judd looks beyond the scope of any one particular learning rule, at a level abo…

Edition
-
ISBN/ISSN
0585359342
Collation
1 online resource (150 pages) :illustrations.
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Circuit Complexity and Neural Networks
Comment Share
Parberry, Ian

Neural networks usually work adequately on small problems but can run into trouble when they are scaled up to problems involving large amounts of input data. Circuit Complexity and Neural Networks addresses the important question of how well neural networks scale - that is, how fast the computation time and number of neurons grow as the problem size increases. It surveys recent research in circ…

Edition
-
ISBN/ISSN
9780262281249
Collation
1 online resource (xxix, 270 pages) :illustrations.
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Communication Complexity: A New Approach to Circuit Depth
Comment Share
Karchmer, Mauricio.

Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as…

Edition
-
ISBN/ISSN
9780262256490
Collation
1 online resource (68 pages).
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Computability and Complexity: From a Programming Perspective
Comment Share
Jones, Neil D.

OCLC-licensed vendor bibliographic record.

Edition
-
ISBN/ISSN
9780262276368
Collation
1 online resource (xvi, 466 pages).
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Computational Theories of Interaction and Agency
Comment Share
Rosenschein, Stanley J.AGRE, Philip E.

"Reprinted from Artificial intelligence, volume 72, numbers 1-2 (January 1995) and volume 73, numbers 1-2 (February 1995)"--Title page verso.Over time the field of artificial intelligence has developed an "agent perspective" expanding its focus from thought to action, from search spaces to physical environments, and from problem-solving to long-term activity. Originally published as a special d…

Edition
1st MIT Press ed.
ISBN/ISSN
9780262291040
Collation
1 online resource (vi, 767 pages) :illustrations.
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
cover
Using hard problems to create pseudorandom generators
Comment Share
Nisan, Noam.

"Noam Nisan is Lecturer in the Department of Computer Science at Hebrew University in Jerusalem. He received his doctoral degree from the University of California, Berkeley.""Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the pow…

Edition
-
ISBN/ISSN
9780262256728
Collation
1 online resource (vi, 43 pages).
Series Title
-
Call Number
-
Availability0
Add to basket
MARC DownloadCite
OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?