447 search results - page 37 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
142
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
129
Voted
JMM2
2007
15 years 3 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
185
Voted
FOGA
2011
14 years 7 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
120
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
123
Voted
CPM
2009
Springer
15 years 10 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...