4377 search results - page 127 / 876 » Mass problems and randomness |
156
click to vote
ANOR
2006
15 years 6 months ago
2006
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
155
click to vote
JAIR
2010
15 years 4 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
169
click to vote
EVOW
2007
Springer
16 years 19 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
174
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
167
click to vote
AAAI
2007
15 years 8 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...