438 search results - page 13 / 88 » New Search Heuristics for Max-CSP |
HM
2007
Springer
15 years 1 months ago
2007
Springer
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
TODAES
2008
14 years 9 months ago
2008
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. Contrary to all previous algorithms, which used binary search on a range of candidate ...
63
Voted
ICGI
1998
Springer
15 years 1 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
72
Voted
AIPS
2010
14 years 12 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...