Sciweavers

389 search results - page 66 / 78
» Route Planning by Analogy
Sort
View
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 23 days ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
PG
2002
IEEE
14 years 17 days ago
Roadmap-Based Flocking for Complex Environments
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
HPCC
2009
Springer
14 years 7 days ago
Grid Network Dimensioning by Modeling the Deadline Constrained Bulk Data Transfers
—Grid applications need to move large amounts of data between distributed resources within deterministic time frames. In most cases it is possible to specify the volume and the d...
Kashif Munir, Pascale Vicat-Blanc Primet, Michael ...
HT
2000
ACM
14 years 12 hour ago
The travails of visually impaired web travellers
This paper proposes the inclusion of travel and mobility in the usability metrics of web design. Hypertext design and usability has traditionally concentrated upon navigation and/...
Carole A. Goble, Simon Harper, Robert Stevens
RIDE
1999
IEEE
13 years 12 months ago
Specification of Cooperative Constraints in Virtual Enterprise Workflow
Workflow systems are an emerging technology which have become increasingly important in the drive for business to provide better services and increase productivity. Intuitively, w...
Anne H. H. Ngu