4488 search results - page 129 / 898 » Focusing Search by Using Problem Solving Experience |
141
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
111
Voted
AAAI
1998
15 years 4 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
135
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
153
Voted
AIPS
2010
15 years 4 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
157
Voted
AGENTS
2001
Springer
15 years 8 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...