Sciweavers

16093 search results - page 140 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
IPCO
2004
144views Optimization» more  IPCO 2004»
15 years 3 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha
CIKM
2010
Springer
14 years 11 months ago
A unified optimization framework for robust pseudo-relevance feedback algorithms
We present a flexible new optimization framework for finding effective, reliable pseudo-relevance feedback models that unifies existing complementary approaches in a principled wa...
Joshua V. Dillon, Kevyn Collins-Thompson
128
Voted
INFOCOM
2006
IEEE
15 years 7 months ago
Optimal Scheduling Algorithms for Input-Queued Switches
— The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high line speeds. A central problem in designing an input-queued swit...
Devavrat Shah, Damon Wischik
ASPDAC
2006
ACM
102views Hardware» more  ASPDAC 2006»
15 years 7 months ago
An O(mn) time algorithm for optimal buffer insertion of nets with m sinks
— Buffer insertion is an effective technique to reduce interconnect delay. In this paper, we give a simple O(mn) time algorithm for optimal buffer insertion, where m is the numbe...
Zhuo Li, Weiping Shi
CPAIOR
2008
Springer
15 years 3 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck