Sciweavers

292 search results - page 7 / 59
» Are Stable Instances Easy
Sort
View
105
Voted
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 7 months ago
On the Stable Paths Problem
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
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 15 days ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
ACMSE
2010
ACM
14 years 10 months ago
Adaptive stable marriage algorithms
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
John Dabney, Brian C. Dean
WADS
2007
Springer
195views Algorithms» more  WADS 2007»
15 years 6 months ago
Approximation Algorithms for the Sex-Equal Stable Marriage Problem
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa
65
Voted
JDCTA
2008
75views more  JDCTA 2008»
15 years 20 days ago
Design and Simulation of Novel Single-Input Sampling Instance Control Circuit
This paper proposes a novel single-input sampling instance control circuit used in primary-side controller of Switch Mode Power Supplies (SMPS) without optical-coupler and seconda...
Xiuxiu Dong, Tiejun Lu, Guicai Hu