Sciweavers

3049 search results - page 194 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
SPAA
1993
ACM
15 years 10 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
CVPR
2005
IEEE
16 years 8 months ago
Damped Newton Algorithms for Matrix Factorization with Missing Data
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
A. M. Buchanan, Andrew W. Fitzgibbon
ATAL
2007
Springer
16 years 20 days ago
An equal excess negotiation algorithm for coalition formation
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
Hrishikesh J. Goradia, José M. Vidal
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 11 months ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong