Sciweavers

3958 search results - page 251 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
JCP
2007
126views more  JCP 2007»
15 years 6 months ago
ADE: Utility Driven Self-management in a Networked Environment
ADE, autonomic distributed environment, is a system which engages autonomic elements to automatically take an existing centralized application and distribute it across available re...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
WEA
2007
Springer
178views Algorithms» more  WEA 2007»
16 years 22 days ago
Engineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
Peter Sanders, Dominik Schultes
NCA
2006
IEEE
16 years 19 days ago
An Adaptive Quality of Service Based Scheduling Algorithm for Wide Area Large Scale Problems
This paper explores the problem of dynamically scheduling large scale applications over wide area networks and then proposes an adaptive scheduling algorithm to provide quality of...
Wilson Lozano, Wilson Rivera
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...