Sciweavers

2911 search results - page 131 / 583
» A Logic of Graph Constraints
Sort
View
POPL
2007
ACM
16 years 1 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
RIDE
1999
IEEE
15 years 5 months ago
Specification of Cooperative Constraints in Virtual Enterprise Workflow
Workflow systems are an emerging technology which have become increasingly important in the drive for business to provide better services and increase productivity. Intuitively, w...
Anne H. H. Ngu
FPGA
1998
ACM
132views FPGA» more  FPGA 1998»
15 years 4 months ago
Circuit Partitioning with Complex Resource Constraints in FPGAs
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
Huiqun Liu, Kai Zhu, D. F. Wong
DKE
2007
129views more  DKE 2007»
15 years 19 days ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado
FOCS
2007
IEEE
15 years 7 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx