Sciweavers

707 search results - page 73 / 142
» Solving path problems on the GPU
Sort
View
PPSN
1998
Springer
15 years 3 months ago
Comparison of Evolutionary Algorithms for Design Optimization
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
Wilfried Jakob, Martina Gorges-Schleuter, Ingo Sie...
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
15 years 6 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
VTC
2007
IEEE
101views Communications» more  VTC 2007»
15 years 6 months ago
P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility
— Mobility in packet networks has become a critical issue in the last years. Mobile IP and the Network Mobility Basic Support Protocol are the IETF proposals to provide mobility....
Rubén Cuevas Rumín, Carmen Guerrero,...
ICTAI
2000
IEEE
15 years 3 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
58
Voted
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
15 years 6 months ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig