608 search results - page 40 / 122 » On Dependent Randomized Rounding Algorithms |
DATE
2004
IEEE
14 years 17 days ago
2004
IEEE
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
ISCAS
2006
IEEE
14 years 2 months ago
2006
IEEE
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
TSP
2008
13 years 8 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
WAW
2009
Springer
14 years 3 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...