Sciweavers

Share
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
8 years 2 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
8 years 2 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys
ISSRE
2010
IEEE
8 years 2 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
ENDM
2010
126views more  ENDM 2010»
8 years 4 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
8 years 4 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CPAIOR
2006
Springer
8 years 6 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
ATAL
2008
Springer
8 years 6 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
AAAI
2008
8 years 6 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
CAEPIA
2003
Springer
8 years 9 months ago
Distributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
Miguel A. Salido, Federico Barber
SSPR
2004
Springer
8 years 9 months ago
Clustering with Soft and Group Constraints
Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering alg...
Martin H. C. Law, Alexander P. Topchy, Anil K. Jai...
books