Sciweavers

14 search results - page 1 / 3
» A Parameterized Benchmark Suite of Hard Pipelined-Machine-Ve...
Sort
View
CHARME
2005
Springer
124views Hardware» more  CHARME 2005»
13 years 10 months ago
A Parameterized Benchmark Suite of Hard Pipelined-Machine-Verification Problems
Panagiotis Manolios, Sudarshan K. Srinivasan
CORR
2011
Springer
142views Education» more  CORR 2011»
12 years 8 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 4 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
13 years 10 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
WCRE
2002
IEEE
13 years 9 months ago
Register Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
Mark Probst, Andreas Krall, Bernhard Scholz