Sciweavers

2398 search results - page 87 / 480
» Constraint Programming and Graph Algorithms
Sort
View
AOSD
2006
ACM
15 years 10 months ago
Towards supporting on-demand virtual remodularization using program graphs
OOP style requires programmers to organize their code according to objects (or nouns, using natural language as a metaphor), causing a program’s actions (verbs) to become scatte...
David Shepherd, Lori L. Pollock, K. Vijay-Shanker
148
Voted
CP
2003
Springer
15 years 10 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
139
Voted
JETAI
2008
93views more  JETAI 2008»
15 years 4 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
DAC
1989
ACM
15 years 8 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
ICML
2005
IEEE
16 years 5 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...