Sciweavers

840 search results - page 166 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
COMSWARE
2007
IEEE
14 years 14 days ago
On Configuring BGP Route Reflectors
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta...
JMLR
2002
157views more  JMLR 2002»
13 years 8 months ago
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...
Alexander Strehl, Joydeep Ghosh
GLOBECOM
2008
IEEE
14 years 3 months ago
Delay-Energy Tradeoffs in Wireless Ad-Hoc Networks with Partial Channel State Information
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
Matthew Brand, Andreas F. Molisch
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
14 years 2 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
CP
2004
Springer
14 years 8 days ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover