221 search results - page 18 / 45 » The cost of not knowing the radius |
104
Voted
JNW
2007
15 years 9 days ago
2007
— 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...
81
Voted
CN
2004
15 years 8 days ago
2004
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...
100
Voted
EKAW
2010
Springer
14 years 11 months ago
2010
Springer
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...
106
click to vote
ICAI
2009
14 years 10 months ago
2009
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...
119
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
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...