Sciweavers

6218 search results - page 1209 / 1244
» Similarity of Semantic Relations
Sort
View
108
Voted
UAI
1997
14 years 11 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
75
Voted
IJCAI
1993
14 years 11 months ago
Provably Bounded Optimal Agents
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
60
Voted
IJCAI
1989
14 years 11 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav
76
Voted
CONEXT
2009
ACM
14 years 10 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...
AIPS
2010
14 years 10 months ago
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
Malte Helmert, Hauke Lasinger
« Prev « First page 1209 / 1244 Last » Next »