Sciweavers

608 search results - page 63 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
CPE
1998
Springer
115views Hardware» more  CPE 1998»
14 years 1 months ago
On Choosing a Task Assignment Policy for a Distributed Server System
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
Mor Harchol-Balter, Mark Crovella, Cristina D. Mur...
VISUALIZATION
2005
IEEE
14 years 2 months ago
Volume rendering of smoke propagation CFD data
The evacuation of buildings in the event of a fire requires careful planning of ventilation and evacuation routes during early architectural design stages. Different designs are ...
Oliver Staubli, Christian Sigg, Ronald Peikert, Ma...
CCGRID
2010
IEEE
13 years 10 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
CORR
2010
Springer
132views Education» more  CORR 2010»
13 years 9 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis