Sciweavers

475 search results - page 18 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 4 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 2 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen
CSR
2007
Springer
14 years 4 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov
IPPS
2005
IEEE
14 years 3 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry