Sciweavers

3737 search results - page 480 / 748
» Parallel Distributed Belief Networks
Sort
View
NPC
2004
Springer
15 years 10 months ago
A Fully Adaptive Fault-Tolerant Routing Methodology Based on Intermediate Nodes
Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the pre...
Nils Agne Nordbotten, María Engracia G&oacu...
MIDDLEWARE
2005
Springer
15 years 10 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
PDPTA
2003
15 years 5 months ago
The Performance of Routing Algorithms under Bursty Traffic Loads
Routing algorithms are traditionally evaluated under Poisson-like traffic distributions. This type of traffic is smooth over large time intervals and has been shown not necessaril...
Jeonghee Shin, Timothy Mark Pinkston
CLADE
2004
IEEE
15 years 8 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza
DCOSS
2007
Springer
15 years 10 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao