Sciweavers

14548 search results - page 2695 / 2910
» The Optimal Path-Matching Problem
Sort
View
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 10 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
HOTOS
1999
IEEE
15 years 10 months ago
The Box: A Replacement for Files
The file is a well-understood and very simple abstraction, which has been successfully used in both centralized and distributed systems. However, files are not expressive enough t...
Francisco J. Ballesteros, Sergio Arévalo
ICPP
1999
IEEE
15 years 10 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
IPPS
1999
IEEE
15 years 10 months ago
Large Scale Simulation of Particulate Flows
Simulations of particles in fluid flows are of great interest to numerous industries using sedimentation, fluidization, lubricated transport, and hydraulic fracturing of hydrocarb...
Ahmed H. Sameh, Vivek Sarin
ISCAS
1999
IEEE
95views Hardware» more  ISCAS 1999»
15 years 10 months ago
Evaluating iterative improvement heuristics for bigraph crossing minimization
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
Matthias F. M. Stallmann, Franc Brglez, Debabrata ...
« Prev « First page 2695 / 2910 Last » Next »