Sciweavers

9842 search results - page 1764 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
136
Voted
CPAIOR
2009
Springer
15 years 10 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
138
Voted
ECSQARU
2009
Springer
15 years 10 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
124
Voted
EGOV
2009
Springer
15 years 10 months ago
eGIF4M: eGovernment Interoperability Framework for Mozambique
Harmonizing decentralized development of ICT solutions with centralized strategies, e.g., meant to favor reuse and optimization of resources, is a complex technical and organizatio...
Pavel Shvaiko, Adolfo Villafiorita, Alessandro Zor...
122
Voted
ESTIMEDIA
2009
Springer
15 years 10 months ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
FMCAD
2009
Springer
15 years 10 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
« Prev « First page 1764 / 1969 Last » Next »