13841 search results - page 300 / 2769 » Algorithms and Constraint Programming |
174
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
175
click to vote
ISDA
2009
IEEE
16 years 1 months ago
2009
IEEE
—Web Services are interfaces that describe a collection of operations that are network-accessible through standardized web protocols. When a required operation is not found, seve...
166
click to vote
CPM
1997
Springer
15 years 10 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
163
click to vote
FCT
2007
Springer
16 years 25 days ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
190
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...