1120 search results - page 10 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
105
click to vote
CLUSTER
2003
IEEE
15 years 2 months ago
2003
IEEE
Dynamic programming is an important algorithm design technique in computational biology and scientific computing. Typical applications using this technique are very compute-intens...
116
click to vote
DFG
1992
Springer
15 years 1 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
CHARME
2001
Springer
15 years 1 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
116
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...