4037 search results - page 376 / 808 » Routing without ordering |
211
Voted
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
109
Voted
ICCD
2006
IEEE
16 years 13 days ago
2006
IEEE
Abstract— In this paper, we introduce a novel preimage computation technique that directly computes the circuit cofactors without an explicit search for any satisfiable solution...
114
Voted
ICCD
2006
IEEE
16 years 13 days ago
2006
IEEE
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
140
click to vote
ICCD
2004
IEEE
16 years 13 days ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
119
click to vote
SOFSEM
2009
Springer
16 years 12 days ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...