Sciweavers

1264 search results - page 76 / 253
» The framework approach for constraint satisfaction
Sort
View
ICPR
2008
IEEE
16 years 20 days ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji
RSS
2007
134views Robotics» more  RSS 2007»
15 years 7 months ago
A Discrete Geometric Optimal Control Framework for Systems with Symmetries
— This paper studies the optimal motion control of mechanical systems through a discrete geometric approach. At the core of our formulation is a discrete Lagrange-d’AlembertPon...
Marin Kobilarov, Mathieu Desbrun, Jerrold E. Marsd...
POPL
2006
ACM
16 years 6 months ago
Associating synchronization constraints with data in an object-oriented language
Concurrency-related bugs may happen when multiple threads access shared data and interleave in ways that do not correspond to any sequential execution. Their absence is not guaran...
Mandana Vaziri, Frank Tip, Julian Dolby
ICTAI
2007
IEEE
16 years 16 days ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
IROS
2007
IEEE
92views Robotics» more  IROS 2007»
16 years 15 days ago
A space decomposition method for path planning of loop linkages
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
Josep M. Porta, Juan Cortés, Lluís R...