Sciweavers

4860 search results - page 159 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 3 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
IJRR
2006
126views more  IJRR 2006»
13 years 10 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
CPM
2003
Springer
68views Combinatorics» more  CPM 2003»
14 years 3 months ago
Multiple Genome Alignment: Chaining Algorithms Revisited
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
SPAA
2004
ACM
14 years 3 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 3 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon