Sciweavers

1460 search results - page 143 / 292
» Meeting people where they are
Sort
View
IAT
2007
IEEE
16 years 25 days ago
A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
Adrian Petcu, Boi Faltings
DCOSS
2007
Springer
16 years 20 days ago
Dwarf: Delay-aWAre Robust Forwarding for Energy-Constrained Wireless Sensor Networks
With the field of wireless sensor networks rapidly maturing, the focus shifts from “easy” deployments, like remote monitoring, to more difficult domains where applications imp...
Mario Strasser, Andreas Meier, Koen Langendoen, Ph...
FC
2005
Springer
142views Cryptology» more  FC 2005»
16 years 20 hour ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
WMCSA
2003
IEEE
15 years 11 months ago
Proximity Mining: Finding Proximity using Sensor Data History
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been develope...
Toshihiro Takada, Satoshi Kurihara, Toshio Hirotsu...
ICPPW
2002
IEEE
15 years 11 months ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen