Sciweavers

1609 search results - page 131 / 322
» Problem Structure and Dependable Architecture
Sort
View
108
Voted
AI
2003
Springer
15 years 5 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
80
Voted
ATAL
2003
Springer
15 years 5 months ago
Automated derivation of behavior vocabularies for autonomous humanoid motion
In this paper we address the problem of automatically deriving vocabularies of motion modules from human motion data, taking advantage of the underlying spatio-temporal structure ...
Odest Chadwicke Jenkins, Maja J. Mataric
113
Voted
LWA
2004
15 years 1 months ago
Dirichlet Enhanced Latent Semantic Analysis
This paper describes nonparametric Bayesian treatments for analyzing records containing occurrences of items. The introduced model retains the strength of previous approaches that...
Kai Yu, Shipeng Yu, Volker Tresp
125
Voted
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 9 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
97
Voted
DAC
2010
ACM
15 years 1 months ago
An efficient dual algorithm for vectorless power grid verification under linear current constraints
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
Xuanxing Xiong, Jia Wang