Sciweavers

5316 search results - page 165 / 1064
» Which Search Problems Are Random
Sort
View
143
Voted
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 3 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
115
Voted
ROBOCUP
2001
Springer
98views Robotics» more  ROBOCUP 2001»
15 years 8 months ago
A Two-Tiered Approach to Self-Localization
Abstract. This paper describes a two-tiered approach to the self-localization problem for soccer playing robots using generic off-the-shelf color cameras. The solution consists of...
Frank de Jong, Jurjen Caarls, Robert Bartelds, Pie...
119
Voted
AAAI
1998
15 years 5 months ago
Learning Evaluation Functions for Global Optimization and Boolean Satisfiability
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems.STAGElearns an evaluation function which predicts the outcom...
Justin A. Boyan, Andrew W. Moore
116
Voted
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 9 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
131
Voted
NIPS
2001
15 years 5 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola