2089 search results - page 199 / 418 » A New Problem in String Searching |
219
click to vote
CPAIOR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
128
click to vote
FLAIRS
2008
15 years 5 months ago
2008
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
103
click to vote
ACG
2006
Springer
15 years 9 months ago
2006
Springer
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
114
click to vote
PAAMS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
114
click to vote
IJIT
2004
15 years 4 months ago
2004
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...