Sciweavers

221 search results - page 18 / 45
» The cost of not knowing the radius
Sort
View
JNW
2007
104views more  JNW 2007»
13 years 7 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
CN
2004
116views more  CN 2004»
13 years 7 months ago
Slotted Aloha as a game with partial information
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered...
Eitan Altman, Rachid El Azouzi, Tania Jimén...
EKAW
2010
Springer
13 years 6 months ago
Extending Open Rating Systems for Ontology Ranking and Reuse
Abstract. Ontology reuse saves costs and improves interoperability between ontologies. Knowing which ontology to reuse is difficult without having a quality assessment. We employ u...
Holger Lewen, Mathieu d'Aquin
ICAI
2009
13 years 5 months ago
The Utility of Affect in the Selection of Actions and Goals Under Real-World Constraints
We present a novel affective goal selection mechanism for decision-making in agents with limited computational resources (e.g., such as robots operating under real-time constraint...
Paul W. Schermerhorn, Matthias Scheutz
ICASSP
2011
IEEE
12 years 11 months ago
Bio-inspired cooperative optimization with application to bacteria motility
Inspired by bacterial motility, we propose an algorithm for adaptation over networks with mobile nodes. The nodes have limited abilities and they are allowed to cooperate with the...
Jianshu Chen, Ali H. Sayed