Sciweavers

4451 search results - page 194 / 891
» On Random Ordering Constraints
Sort
View
144
Voted
SARA
2007
Springer
15 years 11 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
138
Voted
IICS
2005
Springer
15 years 10 months ago
Compositional Constraints Generation for Concurrent Real-Time Loops with Interdependent Iterations
Abstract. In this paper we describe an assume/guarantee based execution constraints synthesis algorithm for concurrent threads executing on parallel platforms. Threads are loops wh...
Ismail Assayad, Sergio Yovine
147
Voted
IDMS
2001
Springer
152views Multimedia» more  IDMS 2001»
15 years 9 months ago
Constraint-Based Configuration of Proxylets for Programmable Networks
Applications such as multimedia streaming for mobile users, or video conferencing, require support within the network for transcoding, compression etc. Proxylets running on servers...
Krish T. Krishnakumar, Morris Sloman
ECAI
2006
Springer
15 years 8 months ago
Enhancing Constraints Manipulation in Semiring-Based Formalisms
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
Stefano Bistarelli, Fabio Gadducci
CSL
2008
Springer
15 years 6 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona