Sciweavers

1594 search results - page 146 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
115
Voted
MIG
2010
Springer
15 years 1 months ago
Navigation Queries from Triangular Meshes
Abstract. Navigation meshes are commonly employed as a practical representation for path planning and other navigation queries in animated virtual environments and computer games. ...
Marcelo Kallmann
AIPS
2007
15 years 5 months ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
132
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 days ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
MOC
2011
14 years 10 months ago
Computing systems of Hecke eigenvalues associated to Hilbert modular forms
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...
Matthew Greenberg, John Voight
116
Voted
ICRA
2003
IEEE
132views Robotics» more  ICRA 2003»
15 years 8 months ago
Optimal strategies to track and capture a predictable target
— We present an O(n log1+ε n)-time algorithm for computing the optimal robot motion that maintains lineof-sight visibility between a target moving inside a polygon with n vertic...
Alon Efrat, Héctor H. González-Ba&nt...