Sciweavers

725 search results - page 118 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
101
Voted
EUROPAR
2005
Springer
15 years 3 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
104
Voted
GECCO
2010
Springer
178views Optimization» more  GECCO 2010»
15 years 2 months ago
Crossing the reality gap in evolutionary robotics by promoting transferable controllers
The reality gap, that often makes controllers evolved in simulation inefficient once transferred onto the real system, remains a critical issue in Evolutionary Robotics (ER); it p...
Sylvain Koos, Jean-Baptiste Mouret, Stéphan...
79
Voted
EMMCVPR
1997
Springer
15 years 1 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
DMSN
2010
ACM
14 years 10 months ago
PAO: power-efficient attribution of outliers in wireless sensor networks
Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitor...
Nikos Giatrakos, Yannis Kotidis, Antonios Deligian...
80
Voted
LATIN
2010
Springer
14 years 8 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese