Sciweavers

4526 search results - page 155 / 906
» Algorithmic problems related to the Internet
Sort
View
DAM
2008
140views more  DAM 2008»
15 years 4 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
INTERNET
2006
157views more  INTERNET 2006»
15 years 4 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
PDP
2010
IEEE
15 years 9 months ago
A Parallel Preconditioned Conjugate Gradient Solver for the Poisson Problem on a Multi-GPU Platform
- We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well sui...
Marco Ament, Günter Knittel, Daniel Weiskopf,...
COR
2007
157views more  COR 2007»
15 years 4 months ago
A decision support system for the single-depot vehicle rescheduling problem
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...
Jing-Quan Li, Denis Borenstein, Pitu B. Mirchandan...