11740 search results - page 220 / 2348 » More Problems in Rewriting |
173
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
152
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
160
Voted
TAMC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
149
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
135
Voted
IJCAI
1993
15 years 6 months ago
1993
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...