Sciweavers

3142 search results - page 536 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
APIN
2000
120views more  APIN 2000»
13 years 9 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
ACMICEC
2004
ACM
162views ECommerce» more  ACMICEC 2004»
14 years 2 months ago
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook D...
ATAL
2003
Springer
14 years 2 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
CVPR
2005
IEEE
14 years 11 months ago
Local Discriminant Embedding and Its Variants
We present a new approach, called local discriminant embedding (LDE), to manifold learning and pattern classification. In our framework, the neighbor and class relations of data a...
Hwann-Tzong Chen, Huang-Wei Chang, Tyng-Luh Liu