92 search results - page 5 / 19 » Making the Breakout Algorithm Complete Using Systematic Sear... |
ICRA
2008
IEEE
15 years 3 months ago
2008
IEEE
— In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe archi...
BMCBI
2010
14 years 9 months ago
2010
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
W4A
2006
ACM
15 years 3 months ago
2006
ACM
It is well known that many Web pages are difficult for visually disabled people to use. Without access to a rich, visual display, the intended structure and organisation of the pa...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
78
Voted
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...