Sciweavers

5165 search results - page 514 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
AIPS
2006
15 years 8 months ago
On Some Tractable Cases of Logical Filtering
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
T. K. Satish Kumar, Stuart J. Russell
NSDI
2004
15 years 8 months ago
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks
Currently, researchers designing and implementing largescale overlay services employ disparate techniques at each stage in the production cycle: design, implementation, experiment...
Adolfo Rodriguez, Charles Edwin Killian, Sooraj Bh...
AIPS
2000
15 years 8 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...
UAI
2003
15 years 8 months ago
Large-Sample Learning of Bayesian Networks is NP-Hard
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
David Maxwell Chickering, Christopher Meek, David ...
TPCD
1994
157views Hardware» more  TPCD 1994»
15 years 8 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...