204 results on '"Craig A. Tovey"'
Search Results
2. The finagle point is close to the yolk.
3. Easy and hard separation of sparse and dense odd-set constraints in matching.
4. Dominance in spatial voting with imprecise ideals.
5. Conditions for Stability in Strategic Matching.
6. Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem.
7. Path Planning on Grids: The Effect of Vertex Placement on Path Length.
8. Path-length analysis for grid-based path planning.
9. On the uniqueness of the yolk.
10. A Comparative Study of Procedures for the Multinomial Selection Problem.
11. Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D.
12. Progress on Agent Coordination with Cooperative Auctions.
13. The complexity of power indexes with graph restricted coalitions.
14. Algorithms and Complexity Results for Pursuit-Evasion Problems.
15. Agent Coordination with Regret Clearing.
16. Multi-robot routing with rewards and disjoint time windows.
17. Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control.
18. Large-scale neuroanatomy using LASSO: Loop-based Automated Serial Sectioning Operation.
19. Improving Sequential Single-Item Auctions.
20. A near-tight approximation lower bound and algorithm for the kidnapped robot problem.
21. The Power of Sequential Single-Item Auctions for Agent Coordination.
22. Auction-Based Multi-Robot Routing.
23. Improved analysis of greedy mapping.
24. Improved analysis of D.
25. Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios.
26. Greedy localization.
27. Greedy Mapping of Terrain.
28. Gridworlds as Testbeds for Planning with Incomplete Information.
29. Algorithms and complexity results for graph-based pursuit evasion.
30. Approximation of the yolk by the LP yolk.
31. A critique of distributional analysis in the spatial model.
32. The instability of instability of centered distributions.
33. The almost surely shrinking yolk.
34. The probability of majority rule instability in the 2D euclidean model with an even number of voters.
35. An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon.
36. Localization: Approximation and Performance Bounds to Minimize Travel Distance.
37. Online Resource Minimization.
38. Smallest tournaments not realizable by \frac23-majority voting.
39. A Near-Tight Approximation Algorithm for the Robot Localization Problem.
40. Polarity and the complexity of the shooting experiment.
41. Solving problems on recursively constructed graphs.
42. A Model for Intransitive Preferences.
43. Optimal single probe traversal algorithm for testing of MCM substrat.
44. Simple lifted cover inequalities and hard knapsack problems.
45. Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic.
46. New Results on the Old k-Opt Algorithm for the TSP.
47. Probabilistic Copeland Tournaments.
48. Towards Completely Decentralized Mustering for StarCraft.
49. Non-approximability of precedence-constrained sequencing to minimize setups.
50. On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.