Sciweavers

2398 search results - page 127 / 480
» Constraint Programming and Graph Algorithms
Sort
View
AAAI
2008
15 years 7 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 11 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
135
Voted
ECEASST
2008
95views more  ECEASST 2008»
15 years 5 months ago
A Static Layout Algorithm for DiaMeta
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
Sonja Maier, Mark Minas
PLDI
2011
ACM
14 years 7 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
JUCS
2006
92views more  JUCS 2006»
15 years 5 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa