504 results on '"Danny Krizanc"'
Search Results
2. Min-max coverage problems on tree-like metrics.
3. Delivery to Safety with Two Cooperating Robots.
4. The En Route Truck-Drone Delivery Problem.
5. Optimal Delivery with a Faulty Drone.
6. Line Search for an Oblivious Moving Target.
7. Optimal rendezvous on a line by location-aware robots in the presence of spies*.
8. Graph Exploration by Energy-Sharing Mobile Agents.
9. The Pony Express Communication Problem.
10. Group Evacuation on a Line by Agents with Different Communication Abilities.
11. The Bike Sharing Problem.
12. Message Delivery in the Plane by Robots with Different Speeds.
13. The Mobile Agent Rendezvous Problem in the Ring
14. Search on a Line by Byzantine Robots.
15. Time-energy tradeoffs for evacuation by two robots in the wireless model.
16. Delivery to Safety with Two Cooperating Robots.
17. Energy Consumption of Group Search on a Line.
18. Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model.
19. Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
20. Weak Coverage of a Rectangular Barrier.
21. Priority evacuation from a disk: The case of n ≥ 4.
22. Priority evacuation from a disk: The case of n = 1, 2, 3.
23. Gathering in the plane of location-aware robots in the presence of spies.
24. Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).
25. Gathering in the Plane of Location-Aware Robots in the Presence of Spies.
26. Satisfying Neighbor Preferences on a Circle.
27. God Save the Queen.
28. Search on a line with faulty robots.
29. Evacuation from a Disc in the Presence of a Faulty Robot.
30. Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.
31. Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults.
32. Weak Coverage of a Rectangular Barrier.
33. Linear Search with Terrain-Dependent Speeds.
34. Know when to persist: Deriving value from a stream buffer.
35. The Bike Sharing Problem.
36. Search on a Line with Faulty Robots.
37. Search on a Line by Byzantine Robots.
38. Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract).
39. Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract).
40. When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
41. Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
42. Optimization Problems in Infrastructure Security.
43. When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
44. Randomized Rendezvous Algorithms for Agents on a Ring with Different Speeds.
45. Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors.
46. Line Search for an Oblivious Moving Target
47. Distributed algorithms for barrier coverage using relocatable sensors.
48. Encoding 2D range maximum queries.
49. Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage.
50. Multi-Robot Foremost Coverage of Time-Varying Graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.