2814 search results - page 177 / 563 » Competitive Analysis of Distributed Algorithms |
ISPDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
144
Voted
DEBS
2008
ACM
15 years 2 months ago
2008
ACM
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
117
Voted
PDPTA
2003
15 years 2 months ago
2003
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
124
click to vote
IDA
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance b...
ESA
2004
Springer
15 years 6 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...