Sciweavers

9572 search results - page 1622 / 1915
» Cover Algorithms and Their Combination
Sort
View
IJCAI
2003
15 years 8 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
UAI
2004
15 years 8 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara
UAI
2004
15 years 8 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes
ISCAPDCS
2003
15 years 8 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
WSC
2001
15 years 8 months ago
Commander behavior and course of action selection in JWARS
The Joint Warfare System (JWARS) is being equipped with a Commander Model (CM) to perform situation assessment and Course of Action (COA) selection, and a Commander Behavior Model...
Deborah Vakas, John Prince, H. Ric Blacksten, Chuc...
« Prev « First page 1622 / 1915 Last » Next »