Sciweavers

1389 search results - page 46 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 3 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
LCPC
2005
Springer
15 years 3 months ago
Concurrency Analysis for Parallel Programs with Textually Aligned Barriers
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
Amir Kamil, Katherine A. Yelick
IJPP
2010
137views more  IJPP 2010»
14 years 8 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
85
Voted
HM
2005
Springer
87views Optimization» more  HM 2005»
15 years 3 months ago
A Taxonomy of Cooperative Search Algorithms
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
Mohammed El-Abd, Mohamed Kamel
ICPP
2009
IEEE
15 years 4 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu