Sciweavers

608 search results - page 8 / 122
» Random Systems with Complete Connections
Sort
View
PAM
2011
Springer
13 years 14 days ago
FACT: Flow-Based Approach for Connectivity Tracking
More than 20 years after the launch of the public Internet, operator forums are still full of reports about temporary unreachability of complete networks. We propose FACT, a system...
Dominik Schatzmann, Simon Leinen, Jochen Köge...
HUC
1999
Springer
14 years 1 months ago
The Role of Connectivity in Supporting Context-Sensitive Applications
This paper considers the role of network connectivity in supporting context-sensitive applications. A range of context-sensitive applications are analysed with respect to connectiv...
Keith Cheverst, Nigel Davies, Keith Mitchell, Adri...
SASO
2007
IEEE
14 years 3 months ago
Identifying Malicious Peers Before It's Too Late: A Decentralized Secure Peer Sampling Service
Many unstructured peer to peer (P2P) systems rely on a Peer Sampling Service (PSS) that returns randomly sampled nodes from the population comprising the system. PSS protocols are...
Gian Paolo Jesi, David Hales, Maarten van Steen
MOBIHOC
2000
ACM
14 years 2 months ago
Proximity awareness and fast connection establishment in Bluetooth
Bluetooth is a promising new technology that enables portable devices to form short-range wireless ad hoc networks and relies on spread spectrum frequency hopping (FH) techniques f...
Theodoros Salonidis, Pravin Bhagwat, Leandros Tass...
JAIR
2007
141views more  JAIR 2007»
13 years 9 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf