Sciweavers

2436 search results - page 38 / 488
» Evaluating Adaptive Problem Selection
Sort
View
AISB
1994
Springer
13 years 11 months ago
An Empirical Comparison of Selection Methods in Evolutionary Algorithms
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Peter J. B. Hancock
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 7 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ESAW
2004
Springer
14 years 1 months ago
Motivation-Based Selection of Negotiation Opponents
Abstract. If we are to enable agents to handle increasingly greater levels of complexity, it is necessary to equip them with mechanisms that support greater degrees of autonomy. Th...
Stephen J. Munroe, Michael Luck
AAAI
2007
13 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICMCS
2007
IEEE
141views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Performance Modeling and Evaluation of Prediction Structures in Multi-View Video Coding
So far, lots of prediction structures have been proposed to exploit the temporal and inter-view redundancy of multi-view video. However, none of them can adapt themselves to diffe...
Chao Chen, Yebin Liu, Qionghai Dai, Xiaodong Liu