4524 search results - page 338 / 905 » The Complexity of Global Constraints |
183
click to vote
MP
2007
15 years 6 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
204
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
184
click to vote
TON
2008
15 years 6 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
225
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
210
click to vote
SOCO
2009
Springer
16 years 1 months ago
2009
Springer
Model composition helps designers managing complexities by modeling different system views separately, and later compose them into an integrated model. In the past years, researche...