ESA
2005
Springer
14 years 5 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
EMO
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
DEXA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
ATAL
2005
Springer
14 years 5 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
There has been signiï¬cant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive†disperser. Past constructions of optimal HSGs have been based ...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a ï¬xed alphabet using queries of the form “does the st...
APPROX
2005
Springer
14 years 5 months ago
2005
Springer
The ï¬eld of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...