Sciweavers

97 search results - page 12 / 20
» Local Strategy Improvement for Parity Game Solving
Sort
View
AAAI
2004
14 years 11 months ago
Learning and Applying Competitive Strategies
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...
Esther Lock, Susan L. Epstein
BMVC
2010
14 years 8 months ago
Diffusion-based Regularisation Strategies for Variational Level Set Segmentation
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
Maximilian Baust, Darko Zikic, Nassir Navab
ICCBR
2009
Springer
15 years 4 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
PC
2010
196views Management» more  PC 2010»
14 years 8 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 4 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...