113 search results - page 8 / 23 » Improved Approximation for the Directed Spanner Problem |
115
Voted
WSC
2004
15 years 5 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
147
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
127
Voted
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
116
click to vote
AAIM
2010
Springer
15 years 7 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...
123
Voted
JCSS
2008
15 years 3 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...