Sciweavers

2434 search results - page 412 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 9 months ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
177
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 7 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
132
Voted
ATAL
2006
Springer
15 years 7 months ago
Distributed navigation in an unknown physical environment
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
Arnon Gilboa, Amnon Meisels, Ariel Felner
IPPS
2009
IEEE
15 years 10 months ago
Power-aware load balancing of large scale MPI applications
Power consumption is a very important issue for HPC community, both at the level of one application or at the level of whole workload. Load imbalance of a MPI application can be e...
Maja Etinski, Julita Corbalán, Jesús...
IPPS
2009
IEEE
15 years 10 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert