Sciweavers

406 search results - page 75 / 82
» Boosting Using Branching Programs
Sort
View
ATAL
2007
Springer
14 years 2 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
CP
2004
Springer
14 years 1 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
MICCAI
2006
Springer
14 years 9 months ago
A Learning Based Algorithm for Automatic Extraction of the Cortical Sulci
This paper presents a learning based method for automatic extraction of the major cortical sulci from MRI volumes or extracted surfaces. Instead of using a few pre-defined rules su...
Songfeng Zheng, Zhuowen Tu, Alan L. Yuille, Allan ...
SAC
2008
ACM
13 years 8 months ago
Towards a model-driven engineering approach for developing embedded hard real-time software
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
Fabiano Cruz, Raimundo S. Barreto, Lucas Cordeiro
ECAI
2008
Springer
13 years 10 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou