Sciweavers

41 search results - page 4 / 9
» Always acyclic distributed path computation
Sort
View
IPPS
1999
IEEE
14 years 2 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 10 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
DOCENG
2006
ACM
14 years 3 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
IEEEPACT
2002
IEEE
14 years 2 months ago
Eliminating Exception Constraints of Java Programs for IA-64
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...
Kazuaki Ishizaki, Tatsushi Inagaki, Hideaki Komats...
WICON
2008
13 years 11 months ago
Towards distributed network classification for mobile ad hoc networks
Mobile ad hoc networks range from traditional MANETs where end-to-end paths exist from sources to destinations, to DTNs where no contemporaneous end-to-end paths exist and communi...
Dimitrios Antonellis, Ahmed Mansy, Konstantinos Ps...