454 search results - page 31 / 91 » On improving approximate solutions by evolutionary algorithm... |
AAIM
2010
Springer
15 years 4 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
APIN
2010
15 years 1 months ago
2010
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
116
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
141
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
145
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...