2957 search results - page 129 / 592 » The Complexity of Polynomial-Time Approximation |
146
Voted
PC
2000
15 years 4 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
125
Voted
DM
1998
15 years 4 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
139
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
156
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
180
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...