Sciweavers

638 search results - page 38 / 128
» Competitive contagion in networks
Sort
View
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 2 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
DATE
2005
IEEE
164views Hardware» more  DATE 2005»
14 years 1 months ago
Automotive System Design - Challenges and Potential
Increasing functional and non-functional requirements in automotive electric /electronic vehicle development will significantly enhance the integration of novel functions in the e...
Harald Heinecke
ICANN
2003
Springer
14 years 1 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 9 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 8 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner