1290 search results - page 203 / 258 » New algorithms of the Q-learning type |
109
click to vote
FPGA
2003
ACM
15 years 10 months ago
2003
ACM
Placement and routing are the most time-consuming processes in automatically synthesizing and configuring circuits for field-programmable gate arrays (FPGAs). In this paper, we ...
153
click to vote
ICVS
2003
Springer
15 years 10 months ago
2003
Springer
We propose a method to construct computer vision systems using a workbench composed of a multi-faceted toolbox and a general purpose kernel. The toolbox is composed of an open set ...
160
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we propose a probabilistic framework that models shape variations and infers dense and detailed 3D shapes from a single silhouette. We model two types of sh...
143
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
134
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...