Sciweavers

4514 search results - page 742 / 903
» Distributed Optimization in Adaptive Networks
Sort
View
CGO
2003
IEEE
15 years 8 months ago
Improving Quasi-Dynamic Schedules through Region Slip
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
Francesco Spadini, Brian Fahs, Sanjay J. Patel, St...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
15 years 7 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
135
Voted
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 4 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
134
Voted
BPM
2009
Springer
143views Business» more  BPM 2009»
15 years 4 months ago
MDPE Workbench - A Solution for Performance Related Decision Support
Abstract. Continuous optimization of business process execution including its adaptation to changes within the market environment or the company itself becomes increasingly importa...
Mathias Fritzsche, Jendrik Johannes, Sebastian Cec...
EOR
2006
125views more  EOR 2006»
15 years 3 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits