Sciweavers

234 search results - page 19 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
IJCAI
2001
14 years 11 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»
15 years 3 months 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
14 years 11 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...
APPT
2003
Springer
15 years 3 months ago
Scheduling Outages in Distributed Environments
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
Anthony Butler, Hema Sharda, David Taniar
SIGGRAPH
1990
ACM
15 years 1 months ago
Fast animation and control of nonrigid structures
We describe a fast method for creating physically based animation of non-rigid objects. Rapid simulation of nonrigid behavior is based on global deformations. Constraints are used...
Andrew P. Witkin, William Welch