1007 search results - page 145 / 202 » The Complexity of Futile Questioning |
127
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
119
Voted
HAIS
2009
Springer
15 years 5 months ago
2009
Springer
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
112
Voted
OOPSLA
2009
Springer
15 years 5 months ago
2009
Springer
During its formative decades the software community looked twice to the theories of ChristopherAlexander for inspiration, both times failing to completely master the architect’s...