Sciweavers

1628 search results - page 215 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
IPPS
1999
IEEE
14 years 2 months ago
GA-Based Parallel Image Registration on Parallel Clusters
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...
Prachya Chalermwat, Tarek A. El-Ghazawi, Jacquelin...
AAAI
2010
13 years 11 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
AMC
2007
129views more  AMC 2007»
13 years 10 months ago
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
14 years 3 months ago
Fast inter frame encoding based on modes pre-decision in H.264
The new video coding standard, H.264 allows motion estimation performing on tree-structured block partitioning and multiple reference frames. This feature improves the prediction ...
Dongming Zhang, Yanfei Shen, Shouxun Lin, Yongdong...
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 11 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg