Sciweavers

10051 search results - page 1628 / 2011
» A Dynamic Separator Algorithm
Sort
View
121
Voted
IWMM
2000
Springer
105views Hardware» more  IWMM 2000»
15 years 8 months ago
Diffusion Tree Restructuring for Indirect Reference Counting
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...
Peter Dickman
CP
1995
Springer
15 years 8 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
SPAA
1995
ACM
15 years 8 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
POPL
1991
ACM
15 years 8 months ago
Coordinating First-Order Multiparty Interactions
-order multiparty interaction is an abstraction mechanism that defines communication among a set of formal process roles. Actual processes participate in a first-order interactio...
Yuh-Jzer Joung, Scott A. Smolka
SC
1991
ACM
15 years 8 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
« Prev « First page 1628 / 2011 Last » Next »