1923 search results - page 158 / 385 » Weighted Decision Trees |
186
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
191
click to vote
ATVA
2007
Springer
16 years 17 days ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
181
click to vote
IJCM
2002
15 years 6 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
166
click to vote
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
162
click to vote
AIPS
2008
15 years 8 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...