Sciweavers

4075 search results - page 187 / 815
» Modeling Distributed Algorithm Using B
Sort
View
114
Voted
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 7 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
MOR
2007
149views more  MOR 2007»
15 years 4 days ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
INFOCOM
2005
IEEE
15 years 6 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu
AIRS
2004
Springer
15 years 6 months ago
Automatic Word Clustering for Text Categorization Using Global Information
This paper presents a cluster-based text categorization system which uses class distributional clustering of words. We propose a new clustering model which considers the global in...
Wenliang Chen, Xingzhi Chang, Huizhen Wang, Jingbo...
108
Voted
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 5 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman