280 search results - page 2 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
INFOCOM
2007
IEEE
2007
IEEE
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion
13 years 11 months ago
Abstract—In this paper we consider the problem of distinguishing whether frame loss at the MAC layer has occurred due to mobility or congestion. Most ad hoc routing protocols mak...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
DM
2002
13 years 4 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
ADHOCNOW
2005
Springer
13 years 10 months ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
AAMAS
2012
Springer
12 years 10 days ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...