Sciweavers

1968 search results - page 11 / 394
» The Complexity of Valued Constraint Models
Sort
View
BPM
2007
Springer
165views Business» more  BPM 2007»
14 years 8 days ago
Modeling Requirements for Value Configuration Design
Breadth and depth complexity are key challenges in achieving business process fusion as the enabler for value configuration design. The PARM framework is proposed as the requiremen...
Eng Chew, Igor Hawryszkiewycz, Michael Soanes
CONSTRAINTS
2002
96views more  CONSTRAINTS 2002»
13 years 8 months ago
QOCA: A Constraint Solving Toolkit for Interactive Graphical Applications
We describe an object-oriented constraint solving toolkit, QOCA, designed for interactive graphical applications. It has a simple yet powerful interface based on the metric space m...
Kim Marriott, Sitt Sen Chok
AAAI
1994
13 years 9 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
AMC
2008
106views more  AMC 2008»
13 years 8 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
CORR
2008
Springer
57views Education» more  CORR 2008»
13 years 8 months ago
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity
Abstract--Space-Time Block Codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zero. The zeros ...
Smarajit Das, B. Sundar Rajan