4233 search results - page 7 / 847 » Three Paths to Effectiveness |
FCCM
2002
IEEE
14 years 11 days ago
2002
IEEE
C-slow retiming (changing a design to support multiple instances of a computation) and datapath-aware placement have long been advocated by members of the FPGA synthesis community...
AAAI
2007
13 years 9 months ago
2007
Sparsity-promoting L1-regularization has recently been succesfully used to learn the structure of undirected graphical models. In this paper, we apply this technique to learn the ...
SC
2000
ACM
13 years 11 months ago
2000
ACM
We report on our work in developing a fine-grained multithreaded solution for the communicationintensive Conjugate Gradient (CG) problem. In our recent work, we developed a simpl...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...