APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
AAECC
2007
Springer
14 years 4 months ago
2007
Springer
AINTEC
2007
Springer
14 years 4 months ago
2007
Springer
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
AIIA
2007
Springer
14 years 4 months ago
2007
Springer
We present two algorithms for supporting semi-automatic ontology building, integrated in WPro, a new architecture for ontology learning from Web documents. The first algorithm auto...
ADAEUROPE
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...