2814 search results - page 142 / 563 » Competitive Analysis of Distributed Algorithms |
123
Voted
IPSN
2009
Springer
15 years 9 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
HPDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
129
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
111
Voted
EMISA
2002
Springer
15 years 2 months ago
2002
Springer
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
133
Voted
TIT
2002
15 years 2 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...