Sciweavers

2109 search results - page 101 / 422
» Solving Necklace Constraint Problems
Sort
View
FLAIRS
2007
15 years 7 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
156
Voted
GMP
2006
IEEE
15 years 11 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
143
Voted
EOR
2010
107views more  EOR 2010»
15 years 5 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
15 years 4 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
135
Voted
CPAIOR
2005
Springer
15 years 10 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith