200 search results - page 39 / 40 » What Graphs can be Efficiently Represented by BDDs |
IJCAI
1989
13 years 6 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
FLAIRS
2004
13 years 6 months ago
2004
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
AOSD
2008
ACM
13 years 7 months ago
2008
ACM
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....