nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A framework for multi-robot node coverage in sensor networks
|
Gasparri, Andrea |
|
2009 |
|
2-4 |
p. 281-305 |
artikel |
2 |
A geometric approach to deploying robot swarms
|
Lee, Geunho |
|
2009 |
|
2-4 |
p. 257-280 |
artikel |
3 |
A three-valued semantics for querying and repairing inconsistent databases
|
Furfaro, Filippo |
|
2008 |
|
2-4 |
p. 167-193 |
artikel |
4 |
Can one design a geometry engine?
|
Makowsky, Johann A. |
|
2018 |
|
2-4 |
p. 259-291 |
artikel |
5 |
Classifying the multi robot path finding problem into a quadratic competitive complexity class
|
Sarid, Shahar |
|
2009 |
|
2-4 |
p. 169-203 |
artikel |
6 |
Complexity results for answer set programming with bounded predicate arities and implications
|
Eiter, Thomas |
|
2008 |
|
2-4 |
p. 123-165 |
artikel |
7 |
Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds
|
Khuller, Samir |
|
2008 |
|
2-4 |
p. 295-331 |
artikel |
8 |
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
|
Amstutz, Patrick |
|
2009 |
|
2-4 |
p. 307-333 |
artikel |
9 |
Distributed multirobot exploration, mapping, and task allocation
|
Vincent, Regis |
|
2009 |
|
2-4 |
p. 229-255 |
artikel |
10 |
Editorial: Annals of Mathematics and Artificial Intelligence special issue on multi-robot coverage, search, and exploration
|
Kaminka, Gal A. |
|
2009 |
|
2-4 |
p. 107-108 |
artikel |
11 |
Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach
|
Rekleitis, Ioannis |
|
2009 |
|
2-4 |
p. 109-142 |
artikel |
12 |
Efficient exploration of unknown indoor environments using a team of mobile robots
|
Stachniss, Cyrill |
|
2009 |
|
2-4 |
p. 205-227 |
artikel |
13 |
Enhancing DLV instantiator by backjumping techniques
|
Perri, Simona |
|
2008 |
|
2-4 |
p. 195-228 |
artikel |
14 |
Foreword
|
Schreck, Pascal |
|
2019 |
|
2-4 |
p. 71-72 |
artikel |
15 |
From informal to formal proofs in Euclidean geometry
|
Stojanović-Ðurđević, Sana |
|
2018 |
|
2-4 |
p. 89-117 |
artikel |
16 |
Implementing Euclid’s straightedge and compass constructions in type theory
|
Kellison, Ariel |
|
2018 |
|
2-4 |
p. 175-192 |
artikel |
17 |
Model checking multi-agent systems with logic based Petri nets
|
Behrens, Tristan M. |
|
2008 |
|
2-4 |
p. 81-121 |
artikel |
18 |
Multiple UAV exploration of an unknown region
|
Sujit, P. B. |
|
2009 |
|
2-4 |
p. 335-366 |
artikel |
19 |
On look-ahead heuristics in disjunctive logic programming
|
Faber, Wolfgang |
|
2008 |
|
2-4 |
p. 229-266 |
artikel |
20 |
Portfolio theorem proving and prover runtime prediction for geometry
|
Nikolić, Mladen |
|
2018 |
|
2-4 |
p. 119-146 |
artikel |
21 |
Preface
|
Subrahmanian, V. S. |
|
2008 |
|
2-4 |
p. 79-80 |
artikel |
22 |
Proof-checking Euclid
|
Beeson, Michael |
|
2019 |
|
2-4 |
p. 213-257 |
artikel |
23 |
Reasoning about non-immediate triggers in biological networks
|
Tran, Nam |
|
2008 |
|
2-4 |
p. 267-293 |
artikel |
24 |
Rewriting input expressions in complex algebraic geometry provers
|
Kovács, Z. |
|
2018 |
|
2-4 |
p. 73-87 |
artikel |
25 |
The giving tree: constructing trees for efficient offline and online multi-robot coverage
|
Agmon, Noa |
|
2009 |
|
2-4 |
p. 143-168 |
artikel |
26 |
Towards a better integration of modelers and black box constraint solvers within the product design process
|
Pernot, Jean-Philippe |
|
2018 |
|
2-4 |
p. 147-173 |
artikel |
27 |
Two cryptomorphic formalizations of projective incidence geometry
|
Braun, David |
|
2018 |
|
2-4 |
p. 193-212 |
artikel |