3875 search results - page 374 / 775 » Approximation algorithms for the 0-extension problem |
160
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
192
click to vote
ADAEUROPE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
153
click to vote
JFPLC
2003
15 years 8 months ago
2003
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
195
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
222
click to vote
SPIRE
2010
Springer
15 years 5 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...