830 search results - page 153 / 166 » Generalizing Global Constraints Based on Network Flows |
ML
2000
ACM
13 years 8 months ago
2000
ACM
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
GECCO
2011
Springer
13 years 4 days ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
FPGA
2003
ACM
14 years 1 months ago
2003
ACM
The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently dev...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
JAIR
2006
13 years 8 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...