Sciweavers

2694 search results - page 218 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 6 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
169
Voted
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 11 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
EUROPAR
2009
Springer
15 years 11 months ago
Distributed Data Partitioning for Heterogeneous Processors Based on Partial Estimation of Their Functional Performance Models
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
Alexey L. Lastovetsky, Ravi Reddy
SPAA
2003
ACM
15 years 11 months ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
IPSN
2005
Springer
15 years 12 months ago
A robust architecture for distributed inference in sensor networks
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
Mark A. Paskin, Carlos Guestrin, Jim McFadden