Sciweavers

152 search results - page 25 / 31
» Solving hard instances of floorplacement
Sort
View
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
14 years 26 days 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
ICDT
2010
ACM
180views Database» more  ICDT 2010»
13 years 11 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
ECOOP
2004
Springer
13 years 11 months ago
A Reflective Approach to Dynamic Software Evolution
In this paper, we present a solution that allows systems to remain active while they are evolving. Our approach goes out from the principle of separated concerns and has two steps....
Peter Ebraert, Tom Tourwé
AAAI
2006
13 years 8 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
CPHYSICS
2006
128views more  CPHYSICS 2006»
13 years 7 months ago
MOMDIS: a Glauber model computer code for knockout reactions
A computer program is described to calculate momentum distributions in stripping and diffraction dissociation reactions. A Glauber model is used with the scattering wavefunctions ...
C. A. Bertulani, A. Gade