Sciweavers

1157 search results - page 103 / 232
» Solving iterated functions using genetic programming
Sort
View
EUROPAR
2009
Springer
15 years 8 months ago
Two-Dimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Based on Their Functional Performance Mod
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
Alexey L. Lastovetsky, Ravi Reddy
JMLR
2006
89views more  JMLR 2006»
15 years 3 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
UIST
1994
ACM
15 years 8 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui
COR
2004
99views more  COR 2004»
15 years 3 months ago
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
Chae Y. Lee, Young P. Moon, Young Joo Cho
TCBB
2008
107views more  TCBB 2008»
15 years 3 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...