Sciweavers

2494 search results - page 174 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
CN
2007
148views more  CN 2007»
13 years 8 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
IPPS
1996
IEEE
14 years 4 days ago
An Adaptive Approach to Data Placement
Programming distributed-memory machines requires careful placement of datato balance the computationalload among the nodes and minimize excess data movement between the nodes. Mos...
David K. Lowenthal, Gregory R. Andrews
JCIT
2008
100views more  JCIT 2008»
13 years 8 months ago
Basic Portal System with the Function of Communication Control for Each User
The Personal Portal is generally used as a communication mean and serves as an entrance to users where they can acquire interested information on the network. We have several prob...
Kazuya Odagiri, Rihito Yaegashi, Masaharu Tadauchi...
TSP
2008
92views more  TSP 2008»
13 years 7 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson
ICDCS
2003
IEEE
14 years 1 months ago
The Hash History Approach for Reconciling Mutual Inconsistency
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
ByungHoon Kang, Robert Wilensky, John Kubiatowicz