Sciweavers

3678 search results - page 2 / 736
» On the Stable Paths Problem
Sort
View
ALGORITHMICA
2010
122views more  ALGORITHMICA 2010»
13 years 5 months ago
Faster Algorithms for Stable Allocation Problems
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
Brian C. Dean, Siddharth Munshi
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 5 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 6 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
TROB
2010
103views more  TROB 2010»
12 years 12 months ago
Time Parameterization of Humanoid-Robot Paths
Abstract--This paper proposes a unified optimization framework to solve the time parameterization problem of humanoid robot paths. Even though the time parameterization problem is ...
Wael Suleiman, Fumio Kanehiro, Eiichi Yoshida, Jea...
ICNP
2002
IEEE
13 years 10 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