Sciweavers

189 search results - page 24 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
WLP
2005
Springer
14 years 1 months ago
Meta-S - Combining Solver Cooperation and Programming Languages
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
Stephan Frank, Petra Hofstedt, Dirk Reckmann
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 12 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ICPR
2006
IEEE
14 years 8 months ago
Calibrating Freely Moving Cameras
We present a novel practical method for self-calibrating a camera which may move freely in space while changing it internal parameters by zooming. We show that point correspondenc...
Hassan Foroosh, Imran N. Junejo, Xiaochun Cao
AIPS
2010
13 years 8 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 2 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz