1155 search results - page 112 / 231 » Continuous dynamic problem generators for evolutionary algor... |
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
122
Voted
TASE
2008
IEEE
15 years 2 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
141
Voted
DPD
2010
15 years 7 days ago
2010
In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We describe a virtual telemetry system that allows us to devise and augment dynamic data-driven application simulations (DDDAS). Virtual telemetry has the advantage that ...
118
click to vote
FM
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...