Sciweavers

6897 search results - page 614 / 1380
» Parallelization of Modular Algorithms
Sort
View
ICDCS
2010
IEEE
15 years 10 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ANCS
2009
ACM
15 years 4 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
CORR
2007
Springer
187views Education» more  CORR 2007»
15 years 6 months ago
Transaction-Oriented Simulation In Ad Hoc Grids
In this paper we analyse the requirements of performing parallel transaction-oriented simulations within loosely coupled systems like Ad Hoc Grids. We focus especially on the spac...
Gerald Krafft
ICRA
1999
IEEE
187views Robotics» more  ICRA 1999»
15 years 10 months ago
VISP: A Software Environment for Eye-in-Hand Visual Servoing
In this paper, we describe a modular software that allows fast development of eye-in-hand image-based visual servoing applications (ViSP states for "Visual Servoing Platform&...
Éric Marchand
POPL
2010
ACM
15 years 9 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...