Sciweavers

808 search results - page 86 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
GMP
2006
IEEE
15 years 3 months ago
Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
Joon-Kyung Seong, Gershon Elber, Elaine Cohen
ATAL
2009
Springer
15 years 4 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
AIPS
2008
15 years 2 days ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová