1.1k citations
- M. Marley24 · h 89
- D. Hollenbach20 · h 77
- A. Tielens4 profiles15 · h 77
- C. Favuzzi4 profiles15 · h 115
- C. Monte4 profiles15 · h 94
- D. Bastieri3 profiles15 · h 128
- E. Bonamente3 profiles15 · h 99
- F. Longo4 profiles15 · h 126
- F. Loparco3 profiles15 · h 117
- G. Barbiellini4 profiles15 · h 130
- G. Tosti3 profiles15 · h 112
- M. Brigida2 profiles15 · h 99
- California Institute of TechnologyUS40 papers
- Search for Extraterrestrial IntelligenceUS36 papers
- University of ArizonaUS34 papers
- Goddard Space Flight CenterUS33 papers
- Center for Astrophysics Harvard & SmithsonianUS27 papers
- University of California, Santa CruzUS27 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Stanford UniversityUS23 papers
- University of Maryland, College ParkUS22 papers
- CEA Paris-SaclayFR21 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR21 papers
- Max Planck Institute for AstronomyDE19 papers
Showing 2011 · cs.AIShow all
3 papers · 2 filters
cs.AI2011★ 87 cited
Collective Intelligence, Data Routing and Braess' Paradox
K. Tumer, D. H. Wolpert
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system so that they work synergistically to maximize a global utili…
cs.AI2011★ 22 cited
Synthesizing Robust Plans under Incomplete Domain Models
Tuan Nguyen, Subbarao Kambhampati, Minh Do
Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts…
cs.AI2011★ 131 cited
Planning Graph Heuristics for Belief Space Search
D. Bryce, S. Kambhampati, D. E. Smith
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distan…