Sciweavers

4117 search results - page 110 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ATAL
2009
Springer
16 years 29 days ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
CP
2009
Springer
15 years 4 months ago
The Proper Treatment of Undefinedness in Constraint Languages
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This p...
Alan M. Frisch, Peter J. Stuckey
IAT
2009
IEEE
16 years 1 months ago
Autonomous UAV Surveillance in Complex Urban Environments
We address the problem of multi-UAV surveillance in complex urban environments with occlusions. The problem consists of coordinating the flight of UAVs with on-board cameras so t...
Eduard Semsch, Michal Jakob, Dusan Pavlícek...
ICC
2009
IEEE
173views Communications» more  ICC 2009»
16 years 1 months ago
Low-Complexity List-Based Frame Synchronization for LDPC Coded Transmission
Abstract—In this paper, we propose a simple and efficient twostage list synchronizer for frame synchronization of Low-Density Parity-Check (LDPC) coded data transmitted over the...
Cedomir Stefanovic, Dejan Vukobratovic, Dragana Ba...
CP
2006
Springer
15 years 10 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...