Sciweavers

344 search results - page 52 / 69
» Some Theorems We Should Prove
Sort
View
MIS
2011
Springer
256views Multimedia» more  MIS 2011»
13 years 2 months ago
Event sharing in vehicular networks using geographic vectors and maps
By exchanging events in a vehicular ad hoc network (VANET), drivers can receive information that allows them to find relevant places (e.g., parking spaces) or avoid dangerous/unde...
Thierry Delot, Sergio Ilarri, Nicolas Cenerario, T...
ICALP
2009
Springer
14 years 2 months ago
Qualitative Concurrent Stochastic Games with Imperfect Information
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
Vincent Gripon, Olivier Serre
SENSYS
2003
ACM
14 years 18 days ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
ATAL
2008
Springer
13 years 9 months ago
Goal generation with relevant and trusted beliefs
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...
Célia da Costa Pereira, Andrea Tettamanzi
JCT
2010
113views more  JCT 2010»
13 years 5 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman