Sciweavers

749 search results - page 54 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
AIMSA
2008
Springer
15 years 1 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
CSCLP
2003
Springer
15 years 4 months ago
Implementing Propagators for Tabular Constraints
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Roman Barták, Roman Mecl
TSP
2010
14 years 5 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
CSL
2008
Springer
15 years 23 days ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
AAAI
2006
15 years 12 days ago
Constraint Symmetry and Solution Symmetry
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...
David A. Cohen, Peter Jeavons, Christopher Jeffers...