Sciweavers

2911 search results - page 79 / 583
» A Logic of Graph Constraints
Sort
View
110
Voted
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
15 years 19 days ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
108
Voted
DATE
2008
IEEE
90views Hardware» more  DATE 2008»
15 years 7 months ago
Computation of Buffer Capacities for Throughput Constrained and Data Dependent Inter-Task Communication
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
108
Voted
AAAI
2008
15 years 2 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
AGP
1999
IEEE
15 years 4 months ago
Extending clp(FD) by Negative Constraint Solving
In this paper we present a novel extension to the constraint logic programming on Finite Domains (clp(FD)) which combines the usual clp(FD) primitive constraint X in range with a ...
Antonio J. Fernández, Patricia M. Hill
83
Voted
CPAIOR
2004
Springer
15 years 6 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit