1355 search results - page 175 / 271 » Alternating Timed Automata over Bounded Time |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider wireless networks in which multiple paths are available between each source and destination. We allow each source to split traffic among all of its available paths, and...
XPU
2005
Springer
14 years 2 months ago
2005
Springer
The main goal to be answered by this Ph.D. thesis is whether there is a potential for a successful and powerful application of agile methods and related techniques to embedded syst...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
PAMI
2008
13 years 9 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
COMPGEOM
1992
ACM
14 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...