Sciweavers

3229 search results - page 567 / 646
» The Theory of Timed Automata
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
WOSS
2004
ACM
14 years 3 months ago
Combining statistical monitoring and predictable recovery for self-management
Complex distributed Internet services form the basis not only of e-commerce but increasingly of mission-critical networkbased applications. What is new is that the workload and in...
Armando Fox, Emre Kiciman, David A. Patterson
FLOPS
2004
Springer
14 years 3 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
ISIPTA
2003
IEEE
120views Mathematics» more  ISIPTA 2003»
14 years 3 months ago
Towards a Chaotic Probability Model for Frequentist Probability: The Univariate Case
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...
Pablo Ignacio Fierens, Terrence L. Fine
MOBICOM
2003
ACM
14 years 2 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano