Sciweavers

2109 search results - page 226 / 422
» Solving Necklace Constraint Problems
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 4 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 11 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
KR
1992
Springer
15 years 10 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
154
Voted
ICCV
2009
IEEE
1520views Computer Vision» more  ICCV 2009»
16 years 11 months ago
A Hand-held Photometric Stereo Camera for 3-D Modeling
This paper presents a simple yet practical 3-D modeling method for recovering surface shape and reflectance from a set of images. We attach a point light source to a hand-held c...
Tomoaki Higo, Yasuyuki Matsushita, Neel Joshi, Kat...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
16 years 26 days ago
Completion Time Minimization and Robust Power Control in Wireless Packet Networks
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
Chris T. K. Ng, Muriel Médard, Asuman E. Oz...