3352 search results - page 458 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
187
click to vote
ICTAI
2005
IEEE
16 years 2 days ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
170
click to vote
SIROCCO
2004
15 years 7 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
176
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
161
click to vote
UIST
2006
ACM
16 years 13 days ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
197
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...