Sciweavers

7522 search results - page 1443 / 1505
» Spacing memetic algorithms
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
ICIAR
2009
Springer
14 years 2 months ago
Implicit Active-Contouring with MRF
In this paper, we present a new image segmentation method based on energy minimization for iteratively evolving an implicit active contour. Methods for active contour evolution is ...
Pierre-Marc Jodoin, Venkatesh Saligrama, Janusz Ko...
MFCS
2009
Springer
14 years 2 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
« Prev « First page 1443 / 1505 Last » Next »