Sciweavers

1378 search results - page 81 / 276
» The Tractability of Global Constraints
Sort
View
CPAIOR
2009
Springer
16 years 23 days ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
16 years 7 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
OPODIS
2010
15 years 4 months ago
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
Piyush Garyali, Matthew Dellinger, Binoy Ravindran
ECAI
2008
Springer
15 years 8 months ago
SLIDE: A Useful Special Case of the CARDPATH Constraint
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
JAIR
2006
102views more  JAIR 2006»
15 years 6 months ago
Set Intersection and Consistency in Constraint Networks
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
Yuanlin Zhang, Roland H. C. Yap