Sciweavers

2899 search results - page 41 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
14 years 11 months ago
Cooperative micro-particle swarm optimization
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
Konstantinos E. Parsopoulos
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 5 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
15 years 5 months ago
Improved independent component regression modeling
The conventional independent component regression (ICR), as an exclusive two-step implementation algorithm, has the risk similar to principal component regression (PCR). That is, t...
Chunhui Zhao, Furong Gao, Tao Liu, Fuli Wang
CODES
2006
IEEE
15 years 7 months ago
A formal approach to robustness maximization of complex heterogeneous embedded systems
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
Arne Hamann, Razvan Racu, Rolf Ernst
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 5 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...