6251 search results - page 1089 / 1251 » Randomness, Computability, and Density |
121
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
129
click to vote
UAI
2004
15 years 5 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
131
click to vote
WSC
2001
15 years 5 months ago
2001
Large-scale military deployments require transporting equipment and personnel over long distances in a short time. Planning an efficient airlift system is complicated and several ...
120
click to vote
WSC
2004
15 years 5 months ago
2004
This paper presents preliminary work done on simulationbased optimization of a stochastic material-dispatching system in a retailer network. The problem we consider is one of dete...
149
click to vote
PSB
2003
15 years 5 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...