2519 search results - page 330 / 504 » Martingales and Locality in Distributed Computing |
133
Voted
HICSS
1999
IEEE
15 years 5 months ago
1999
IEEE
In this paper, we motivate the importance of the field of mobile computing and survey current practical and formal approaches. We argue that the existing formalisms are not suffic...
109
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We investigate the problem of learning to predict moves in the board game of Go from game records of expert players. In particular, we obtain a probability distribution over legal...
107
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
93
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This chapter describes a principled, yet computationally efficient way for a team of UAVs with Received Signal Strength Indicator (RSSI) sensors to locate radio frequency emitting...
79
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...