Sciweavers

340 search results - page 53 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
14 years 1 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
ADHOCNOW
2009
Springer
13 years 8 months ago
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplo...
PLDI
2003
ACM
14 years 29 days ago
Taming the IXP network processor
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
Lal George, Matthias Blume
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 1 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 16 days ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek