4565 search results - page 367 / 913 » Time Optimal Self-Stabilizing Algorithms |
178
click to vote
DATE
2005
IEEE
16 years 11 days ago
2005
IEEE
The objective of this paper is to introduce dependability as an optimization criterion in the system-level design process of embedded systems. Given the pervasiveness of embedded ...
197
click to vote
TNN
2010
15 years 1 months ago
2010
We propose a multiple incremental decremental algorithm of Support Vector Machine (SVM). Conventional single incremental decremental SVM can update the trained model efficiently w...
165
click to vote
WAOA
2004
Springer
16 years 3 days ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
180
click to vote
ATMOS
2008
15 years 8 months ago
2008
Abstract. In this paper we explore the possibility of applying the notions of Recoverable Robustness and Price of Recoverability (introduced by [5]) to railway rolling stock planni...
163
click to vote
SPAA
2003
ACM
16 years 7 hour ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...