Sciweavers

7930 search results - page 1153 / 1586
» Greedy in Approximation Algorithms
Sort
View
ESWS
2005
Springer
16 years 10 days ago
Semantic-Based Automated Composition of Distributed Learning Objects for Personalized E-Learning
Recent advances in e-learning techonologies and web services make realistic the idea that courseware for personalized e-learning can be built by dynamic composition of distributed ...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
16 years 10 days ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
JSSPP
2005
Springer
16 years 9 days ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
PPDP
2005
Springer
16 years 9 days ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
STACS
2005
Springer
16 years 9 days ago
Centrality Measures Based on Current Flow
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
Ulrik Brandes, Daniel Fleischer
« Prev « First page 1153 / 1586 Last » Next »