Sciweavers

6365 search results - page 445 / 1273
» Fast Local Computation Algorithms
Sort
View
CASCON
2006
117views Education» more  CASCON 2006»
15 years 9 months ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
FSTTCS
2004
Springer
16 years 29 days ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi
157
Voted
ICRA
2006
IEEE
123views Robotics» more  ICRA 2006»
16 years 1 months ago
Bounding Uncertainty in EKF-SLAM: the Robocentric Local Approach
— This paper addresses the consistency issue of the Extended Kalman Filter approach to the simultaneous localization and mapping (EKF-SLAM) problem. Linearization of the inherent...
Ruben Martinez-Cantin, José A. Castellanos
145
Voted
ATAL
2004
Springer
16 years 29 days ago
Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
Dmitri A. Dolgov, Edmund H. Durfee
EMO
2003
Springer
137views Optimization» more  EMO 2003»
16 years 24 days ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle