400 search results - page 57 / 80 » Backtracking |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
Locating arteries hidden beneath superficial tissue can be a difficult task in minimally invasive surgery. This paper reports the development of a system that finds the paths of a...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
KBSE
2002
IEEE
14 years 1 months ago
2002
IEEE
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
LEC
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper discusses the processing of negative verbal forms in Oriya in a deterministic Finite State Automaton. A morphologically agglutinative language like Oriya has ‘phrasal...