Sciweavers

1142 search results - page 19 / 229
» Approximability of Clausal Constraints
Sort
View
TON
2008
119views more  TON 2008»
15 years 6 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
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...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
APPROX
2010
Springer
297views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximating Linear Threshold Predicates
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
Mahdi Cheraghchi, Johan Håstad, Marcus Isaks...
CP
2005
Springer
16 years 2 days ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 5 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
SIAMCO
2010
124views more  SIAMCO 2010»
15 years 1 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...