2446 search results - page 321 / 490 » Choiceless Polynomial Time |
AIPS
2006
13 years 9 months ago
2006
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
NIPS
1996
13 years 9 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
IJCAI
1989
13 years 9 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
30
Voted
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
ALGORITHMICA
2010
13 years 8 months ago
2010
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...