5316 search results - page 98 / 1064 » Which Search Problems Are Random |
151
click to vote
ICML
1994
IEEE
15 years 6 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
246
click to vote
NLP
2000
15 years 7 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
270
Voted
OL
2011
14 years 10 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
107
click to vote
WSC
2007
15 years 5 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
128
click to vote
EVOW
2001
Springer
15 years 7 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...