832 search results - page 22 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
79
Voted
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
105
click to vote
TMC
2008
14 years 9 months ago
2008
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
JPDC
1998
14 years 9 months ago
1998
Programlibraries are one tool to make the cooperation between specialists from various elds successful: the separation of application-speci c knowledge from applicationindependent...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...