Name
Abstract | ||
|---|---|---|
We introduce Grid-based SensorDCSP, a geometri cally structured benchmark problem for the study of distributed CSP algorithms. This domain pro vides realistic structure of the communication and tracking constraints. We formally define this prob lem, and perform its worst-case complexity analy sis. Likewise, we provide an average case empirical analysis of the AWC algorithm, studying its behav ior on tractable and intractable sub-classes of our problem. |
Year | Venue | Keywords |
|---|---|---|
2003 | IJCAI | information gathering plan,o latency,grid-based sensordcsp,speculative execution,data value,overall performance |
Field | DocType | Citations |
Benchmark (surveying),Computer science,Artificial intelligence,Computer engineering,Machine learning,Grid | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ramón Béjar | 1 | 305 | 36.72 |
| Carmel Domshlak | 2 | 2156 | 123.57 |
| Cèsar Fernández | 3 | 157 | 19.19 |
| Carla P. Gomes | 4 | 2344 | 179.21 |
| Bart Selman | 5 | 8355 | 913.69 |
| Magda Valls | 6 | 67 | 8.68 |