3049 search results - page 304 / 610 » On the Convergence of Bound Optimization Algorithms |
179
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
166
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
144
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
168
click to vote
GRID
2007
Springer
15 years 10 months ago
2007
Springer
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
148
click to vote
AAMAS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...