Sciweavers

3446 search results - page 321 / 690
» A Reasoning Algorithm for pD*
Sort
View
UAI
1997
15 years 8 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
APLAS
2010
ACM
15 years 5 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
SIAMJO
2010
136views more  SIAMJO 2010»
15 years 1 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ICDM
2006
IEEE
100views Data Mining» more  ICDM 2006»
16 years 20 days ago
Meta Clustering
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
Rich Caruana, Mohamed Farid Elhawary, Nam Nguyen, ...
LPNMR
2001
Springer
15 years 11 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits