3864 search results - page 643 / 773 » time 2005 |
122
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
121
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
158
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
123
click to vote
ANOR
2005
15 years 4 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
128
click to vote
ANOR
2005
15 years 4 months ago
2005
In this paper we consider a game-theoretic dynamic model describing the exploitation of a renewable resource. Our model is based on a Cournot oligopoly game where n profit-maximizi...