Sciweavers

4926 search results - page 206 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CCGRID
2006
IEEE
16 years 12 days ago
Imprecise Computation Grid Application Model for Flexible Market-Based Resource Allocation
Market-based resource management is becoming an emerging issue as the utilization of Grid computing is growing rapidly, particularly in the business field. In this paper, we prov...
Kyong Hoon Kim, Rajkumar Buyya, Jong Kim
IEEEPACT
1998
IEEE
15 years 10 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
RSS
2007
147views Robotics» more  RSS 2007»
15 years 7 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
15 years 11 months ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
200
Voted
PODC
2009
ACM
16 years 6 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young