1871 search results - page 287 / 375 » The Ephemeral Pairing Problem |
166
click to vote
MOBICOM
2010
ACM
15 years 6 months ago
2010
ACM
Finding a person in a public place, such as in a library, conference hotel, or shopping mall, can be difficult. The difficulty arises from not knowing where the person may be at t...
182
click to vote
DCOSS
2010
Springer
15 years 6 months ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
186
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 6 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
168
click to vote
AICOM
2008
15 years 6 months ago
2008
Since speaker's intentions can be represented into domain actions (pairs of domain-independent speech acts and domain-dependent concept sequences) in goal-oriented dialogues,...
170
click to vote
CN
2010
15 years 6 months ago
2010
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...