Sciweavers

7930 search results - page 273 / 1586
» Greedy in Approximation Algorithms
Sort
View
PPSN
2004
Springer
15 years 12 months ago
Evaluation of Adaptive Nature Inspired Task Allocation Against Alternate Decentralised Multiagent Strategies
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
Richard Price, Peter Tiño
WG
2004
Springer
15 years 12 months ago
Crossing Reduction in Circular Layouts
We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the si...
Michael Baur, Ulrik Brandes
APVIS
2009
15 years 7 months ago
Dual streamline seeding
This work introduces a novel streamline seeding technique based on dual streamlines that are orthogonal to the vector field, instead of tangential. The greedy algorithm presented ...
Olufemi Rosanwo, Christoph Petz, Steffen Prohaska,...
ISCI
2008
102views more  ISCI 2008»
15 years 6 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti
JSS
2008
65views more  JSS 2008»
15 years 6 months ago
Process pipeline scheduling
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
Melissa Lemos, Marco A. Casanova, Antonio L. Furta...