4451 search results - page 264 / 891 » On Random Ordering Constraints |
166
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
461
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
172
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...
165
click to vote
SARA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
190
click to vote
CPAIOR
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...