Sciweavers

5153 search results - page 840 / 1031
» Introduction to Randomized Algorithms
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 9 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
134
Voted
ISSTA
2004
ACM
15 years 8 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
SPAA
2004
ACM
15 years 8 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
ATAL
2003
Springer
15 years 8 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
15 years 8 months ago
Evolutionary Multimodal Optimization Revisited
Abstract. We revisit a class of multimodal function optimizations using evolutionary algorithms reformulated into a multiobjective framework where previous implementations have nee...
Rajeev Kumar, Peter Rockett