Sciweavers

1300 search results - page 87 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
PRICAI
2004
Springer
15 years 3 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
CP
2008
Springer
14 years 12 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
AAAI
2008
15 years 14 days ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
SSD
2007
Springer
116views Database» more  SSD 2007»
15 years 4 months ago
Continuous Constraint Query Evaluation for Spatiotemporal Streams
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
Marios Hadjieleftheriou, Nikos Mamoulis, Yufei Tao
ECAI
2004
Springer
15 years 3 months ago
Boosting Systematic Search by Weighting Constraints
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
Frédéric Boussemart, Fred Hemery, Ch...