Sciweavers

866 search results - page 100 / 174
» On Dynamic Shortest Paths Problems
Sort
View
DAIS
2003
15 years 7 months ago
Planning for Network-Aware Paths
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
Xiaodong Fu, Vijay Karamcheti
EDBT
2008
ACM
111views Database» more  EDBT 2008»
16 years 6 months ago
On-line discovery of hot motion paths
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...
Dimitris Sacharidis, Kostas Patroumpas, Manolis Te...
PDP
2005
IEEE
15 years 11 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
DAC
2004
ACM
15 years 11 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
HICSS
2000
IEEE
106views Biometrics» more  HICSS 2000»
15 years 10 months ago
Integrating Transportation in a Multi-Site Scheduling Environment
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites...
Jürgen Sauer, Hans-Jürgen Appelrath