Sciweavers

169 search results - page 28 / 34
» Decentralized Search with Random Costs
Sort
View
ICALP
2005
Springer
14 years 7 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
MST
2006
136views more  MST 2006»
13 years 6 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ICDCS
2008
IEEE
14 years 1 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
14 years 1 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
CEC
2007
IEEE
14 years 1 months ago
Evolvability and Redundancy in Shared Grammar Evolution
— Shared grammar evolution (SGE) is a novel scheme for representing and evolving a population of variablelength programs as a shared set of grammatical productions. Productions t...
Martin H. Luerssen, David M. W. Powers