Sciweavers

3082 search results - page 336 / 617
» New Bounds for the Controller Problem
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
ATAL
2009
Springer
16 years 1 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
IJCNN
2006
IEEE
16 years 22 days ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
ICALP
2005
Springer
16 years 6 days ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
CP
2004
Springer
16 years 3 days ago
Constraint Propagation as a Proof System
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
Albert Atserias, Phokion G. Kolaitis, Moshe Y. Var...