Sciweavers

9325 search results - page 261 / 1865
» The decentralized implementability problem
Sort
View
ICNP
2002
IEEE
15 years 9 months ago
Analysis of the MED Oscillation Problem in BGP
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...
Timothy Griffin, Gordon T. Wilfong
CPAIOR
2010
Springer
15 years 8 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 7 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
MSV
2004
15 years 5 months ago
An Effective QBF Solver for Planning Problems
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
Charles Otwell, Anja Remshagen, Klaus Truemper
UAI
2003
15 years 5 months ago
The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach
We present an application of hierarchical Bayesian estimation to robot map building. The revisiting problem occurs when a robot has to decide whether it is seeing a previously-bui...
Benjamin Stewart, Jonathan Ko, Dieter Fox, Kurt Ko...