1382 search results - page 155 / 277 » Formal Analysis of Online Algorithms |
171
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
198
click to vote
EMSOFT
2010
Springer
15 years 4 months ago
2010
Springer
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
221
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
175
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
168
click to vote
MMB
2004
Springer
15 years 11 months ago
2004
Springer
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...