Sciweavers

27 search results - page 3 / 6
» Efficient feasibility testing for dial-a-ride problems
Sort
View
CCCG
1996
13 years 8 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ITC
2003
IEEE
148views Hardware» more  ITC 2003»
14 years 22 days ago
HyAC: A Hybrid Structural SAT Based ATPG for Crosstalk
As technology evolves into the deep sub-micron era, signal integrity problems are growing into a major challenge. An important source of signal integrity problems is the crosstalk...
Xiaoliang Bai, Sujit Dey, Angela Krstic
JSA
2008
116views more  JSA 2008»
13 years 7 months ago
Analyzing composability of applications on MPSoC platforms
Modern day applications require use of multi-processor systems for reasons of performance, scalability and power efficiency. As more and more applications are integrated in a sing...
Akash Kumar, Bart Mesman, Bart D. Theelen, Henk Co...