Sciweavers

565 search results - page 78 / 113
» Heuristics for Planning with SAT
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 8 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 6 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
ICCAD
2005
IEEE
118views Hardware» more  ICCAD 2005»
14 years 4 months ago
Thermal via planning for 3-D ICs
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
Jason Cong, Yan Zhang
ISLPED
2010
ACM
181views Hardware» more  ISLPED 2010»
13 years 6 months ago
Exploiting power budgeting in thermal-aware dynamic placement for reconfigurable systems
 In this paper, a novel thermal-aware dynamic placement planner for reconfigurable systems is presented, which targets transient temperature reduction. Rather than solving time-...
Shahin Golshan, Eli Bozorgzadeh, Benjamin Carri&oa...
AI
2000
Springer
13 years 7 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...