7796 search results - page 301 / 1560 » On Generalized Schur Numbers |
187
click to vote
CCCG
1998
15 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
143
click to vote
WSC
2000
15 years 8 months ago
2000
We present and evaluate two ranking-and-selection procedures for use in steady-state simulation experiments when the goal is to find which among a finite number of alternative sys...
174
click to vote
CASCON
1996
15 years 8 months ago
1996
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
156
click to vote
AAAI
1992
15 years 8 months ago
1992
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English speci cations i...
168
click to vote
UAI
1989
15 years 8 months ago
1989
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...