2722 search results - page 400 / 545 » Hastily formed networks |
104
click to vote
INFORMS
1998
15 years 19 days ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
WINET
2002
15 years 18 days ago
2002
Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of ex...
116
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
An important issue in wireless communication is the interaction between selfish and independent wireless communication systems in the same frequency band. Due to the selfish natur...
115
click to vote
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
—In this paper, we present and analyze the properties of a new class of games - the spatial congestion game (SCG), which is a generalization of the classical congestion game (CG)...