Sciweavers

1615 search results - page 103 / 323
» Computer science and decision theory
Sort
View
99
Voted
CSR
2006
Springer
15 years 4 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
100
Voted
GI
2009
Springer
14 years 10 months ago
Use of Situation Awareness Data by the CDA
: Situation awareness for ground combat vehicles is being actively developed by the U.S. Army to enable soldiers and commanders to have a better understanding of their environments...
Ronald Matthew Yannone, Bryan Beaudoin, Howard Par...
103
Voted
FOCS
2006
IEEE
15 years 6 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
FOCS
1999
IEEE
15 years 4 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
104
Voted
ECUMN
2007
Springer
15 years 6 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson