Sciweavers

13841 search results - page 291 / 2769
» Algorithms and Constraint Programming
Sort
View
PDP
2010
IEEE
16 years 1 months ago
Skandium: Multi-core Programming with Algorithmic Skeletons
—This paper argues that algorithmic skeletons are a suitable programming model for multi-core architectures. -level abstractions offered by algorithmic skeletons provide a simple...
Mario Leyton, José M. Piquer
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
CPAIOR
2006
Springer
15 years 10 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 6 months ago
Interior-Point Algorithms for Linear-Programming Decoding
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
Pascal O. Vontobel
SCAM
2007
IEEE
16 years 28 days ago
An Evaluation of Slicing Algorithms for Concurrent Programs
Program slicing is a program-reduction technique for extracting statements that may influence other statements. While there exist efficient algorithms to slice sequential progra...
Dennis Giffhorn, Christian Hammer