4860 search results - page 524 / 972 » SNPs Problems, Complexity, and Algorithms |
201
Voted
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
166
Voted
IEAAIE
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
184
Voted
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
192
Voted
IJCAI
2003
15 years 8 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
175
click to vote
AAAI
2000
15 years 8 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...