Sciweavers

13841 search results - page 53 / 2769
» Algorithms and Constraint Programming
Sort
View
ECAI
2008
Springer
15 years 2 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 29 days ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
117
Voted
ATAL
2007
Springer
15 years 6 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
182
Voted
DC
2011
14 years 7 days ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
85
Voted
AAAI
2010
15 years 1 months ago
A First Practical Algorithm for High Levels of Relational Consistency
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
Shant Karakashian, Robert J. Woodward, Christopher...