Sciweavers

239 search results - page 18 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
DAC
2009
ACM
14 years 8 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
CSCLP
2005
Springer
14 years 1 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 24 days ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
DSRT
2008
IEEE
13 years 9 months ago
Two Complementary Tools for the Formal Testing of Distributed Systems with Time Constraints
The complexity and the variety of the deployed timedependent systems, as well as the high degree of reliability required for their global functioning, justify the care provided to...
Ana R. Cavalli, Edgardo Montes de Oca, Wissam Mall...