Sciweavers

1243 search results - page 181 / 249
» Complexity reduction of C-Algorithm
Sort
View
CPAIOR
2009
Springer
15 years 8 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
FMCAD
2009
Springer
15 years 8 months ago
Scaling VLSI design debugging with interpolation
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
Brian Keng, Andreas G. Veneris
SARA
2009
Springer
15 years 8 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
MOBILWARE
2009
ACM
15 years 7 months ago
Middleware Solutions for Self-organizing Multi-hop Multi-path Internet Connectivity Based on Bluetooth
The availability of heterogeneous wireless interfaces and of growing computing resources on widespread portable devices pushes for enabling innovative deployment scenarios where mo...
Paolo Bellavista, Carlo Giannelli
CDC
2008
IEEE
15 years 7 months ago
Shannon meets Bellman: Feature based Markovian models for detection and optimization
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...
Sean P. Meyn, George Mathew