Sciweavers

719 search results - page 19 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
GIS
2005
ACM
15 years 10 months ago
Adaptive nearest neighbor queries in travel time networks
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
Wei-Shinn Ku, Roger Zimmermann, Haojun Wang, Chi-N...
ICA3PP
2010
Springer
15 years 2 months ago
On-Line Task Granularity Adaptation for Dynamic Grid Applications
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
Nithiapidary Muthuvelu, Ian Chai, Eswaran Chikkann...
IPPS
2007
IEEE
15 years 4 months ago
On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids
Abstract— We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to alloca...
Claris Castillo, George N. Rouskas, Khaled Harfous...
ATAL
2007
Springer
15 years 3 months ago
Periodic real-time resource allocation for teams of progressive processing agents
In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA , that exploi...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
NIPS
2007
14 years 11 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...