2398 search results - page 79 / 480 » Constraint Programming and Graph Algorithms |
127
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
131
click to vote
ASAP
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
126
click to vote
AIPS
2000
15 years 6 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
169
click to vote
SIGSOFT
1994
ACM
15 years 8 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
251
click to vote
ICDCN
2011
Springer
14 years 8 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...