294 search results - page 57 / 59 » The complexity of computing a Nash equilibrium |
CONEXT
2008
ACM
14 years 11 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
101
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
ALGOSENSORS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
GEOINFO
2003
14 years 11 months ago
2003
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
62
Voted
JCC
2007
14 years 9 months ago
2007
: The role of radial nodes, or of their absence, in valence orbitals for chemical bonding and periodic trends is discussed from a unified viewpoint. In particular, we emphasize th...