Sciweavers

975 search results - page 94 / 195
» Locality Optimization for Program Instances
Sort
View
EVOW
2009
Springer
14 years 2 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
PPSN
1998
Springer
14 years 1 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
CLOR
2006
14 years 1 months ago
A Sparse Object Category Model for Efficient Learning and Complete Recognition
We present a "parts and structure" model for object category recognition that can be learnt efficiently and in a weakly-supervised manner: the model is learnt from examp...
Robert Fergus, Pietro Perona, Andrew Zisserman
ICDE
2009
IEEE
119views Database» more  ICDE 2009»
14 years 4 months ago
Deductive Framework for Programming Sensor Networks
—Developing powerful paradigms for programming sensor networks is critical to realize the full potential of sensor networks as collaborative data processing engines. In this arti...
Himanshu Gupta, Xianjin Zhu, Xiang Xu
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 4 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper