Sciweavers

706 search results - page 49 / 142
» Super Solutions in Constraint Programming
Sort
View
CP
2006
Springer
15 years 3 months ago
Constraint Based Resilience Analysis
Abstract. In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in mo...
Helmut Simonis
ACL
2010
14 years 9 months ago
Hard Constraints for Grammatical Function Labelling
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
Wolfgang Seeker, Ines Rehbein, Jonas Kuhn, Josef v...
ESORICS
2010
Springer
15 years 1 hour ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
ATAL
2006
Springer
15 years 3 months ago
A constraint optimization framework for fractured robot teams
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
Mary Koes, Katia P. Sycara, Illah R. Nourbakhsh
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 9 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer