Sciweavers

4565 search results - page 150 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
INFOCOM
2008
IEEE
14 years 4 months ago
Real-Time Video Multicast in WiMAX Networks
Abstract—IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such...
Supratim Deb, Sharad Jaiswal, Kanthi Nagaraj
GECCO
2003
Springer
14 years 3 months ago
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
Kumara Sastry, David E. Goldberg
JGO
2010
89views more  JGO 2010»
13 years 8 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
14 years 4 months ago
Buyer-Supplier Games: Optimization over the Core
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
Nedialko B. Dimitrov, C. Greg Plaxton