Sciweavers

6274 search results - page 420 / 1255
» From query complexity to computational complexity
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
AI
2008
Springer
15 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
NC
2008
15 years 6 months ago
How crystals that sense and respond to their environments could evolve
An enduring mystery in biology is how a physical entity simple enough to have arisen spontaneously could have evolved into the complex life seen on Earth today. Cairns-Smith has pr...
Rebecca Schulman, Erik Winfree

Book
376views
17 years 4 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
AUTOMOTIVEUI
2009
ACM
16 years 1 months ago
Heart on the road: HRV analysis for monitoring a driver's affective state
Driving a vehicle is a task affected by an increasing number and a rising complexity of Driver Assistance Systems (DAS) resulting in a raised cognitive load of the driver, and in...
Andreas Riener, Alois Ferscha, Mohamed Aly