14 search results - page 2 / 3 » Worst Case and Probabilistic Analysis of the 2-Opt Algorithm... |
SPAA
2000
ACM
13 years 10 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
ISQED
2006
IEEE
14 years 2 days ago
2006
IEEE
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
MDM
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
QEST
2008
IEEE
14 years 13 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...