Sciweavers

6943 search results - page 1045 / 1389
» Representations for evolutionary algorithms
Sort
View
MLMI
2005
Springer
16 years 7 days ago
A Multimodal Discourse Ontology for Meeting Understanding
In this paper, we present a multimodal discourse ontology that serves as a knowledge representation and annotation framework for the discourse understanding component of an artifi...
John Niekrasz, Matthew Purver
SAT
2005
Springer
123views Hardware» more  SAT 2005»
16 years 7 days ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
SLSFS
2005
Springer
16 years 7 days ago
Generalization Bounds for Subspace Selection and Hyperbolic PCA
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
Andreas Maurer
WG
2005
Springer
16 years 7 days ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
AUSAI
2005
Springer
16 years 7 days ago
Model Checking for PRS-Like Agents
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
Wayne Wobcke, Marc Chee, Krystian Ji
« Prev « First page 1045 / 1389 Last » Next »