Sciweavers

3367 search results - page 308 / 674
» Incremental assignment problem
Sort
View
CIE
2007
Springer
15 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
HM
2007
Springer
137views Optimization» more  HM 2007»
15 years 10 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
121
Voted
RTS
2008
134views more  RTS 2008»
15 years 3 months ago
On earliest deadline first scheduling for temporal consistency maintenance
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is te...
Ming Xiong, Qiong Wang, Krithi Ramamritham
129
Voted
ICARCV
2008
IEEE
146views Robotics» more  ICARCV 2008»
15 years 11 months ago
Stabilization of networked multi-input systems with channel resource allocation
—In this paper, we study the problem of stabilizing a linear time-invariant discrete-time system with information constraints in the input channels. The information constraint in...
Guoxiang Gu, Li Qiu
JMLR
2006
125views more  JMLR 2006»
15 years 4 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss