Sciweavers

189 search results - page 19 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
IJCAI
1989
13 years 8 months ago
Building a World Model for a Mobile Robot Using Dynamic Semantic Constraints
We are developing a new paradigm for a world model construction system which interprets a scene and builds a world model for a mobile robot using dynamic semantic constraints. The...
Minoru Asada, Yoshiaki Shirai
ECCV
2008
Springer
14 years 9 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios
ATMOS
2007
152views Optimization» more  ATMOS 2007»
13 years 9 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
13 years 5 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 2 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo