5314 search results - page 691 / 1063 » Hybrid Dynamic Programming |
197
click to vote
ICS
2001
Tsinghua U.
15 years 11 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
197
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
185
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Executing subordinate activities by pushing return addresses on the stack is the most e cient working mode for sequential programs. It is supported by all current processors, yet i...
181
Voted
ICCAD
1998
IEEE
15 years 11 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
178
click to vote
AGENTS
1998
Springer
15 years 11 months ago
1998
Springer
Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resour...