Sciweavers

14548 search results - page 2717 / 2910
» The Optimal Path-Matching Problem
Sort
View
ASPDAC
2005
ACM
106views Hardware» more  ASPDAC 2005»
15 years 8 months ago
On structure and suboptimality in placement
Abstract— Regular structures are present in many types of circuits. If this structure can be identified and utilized, performance can be improved dramatically. In this paper, we...
Satoshi Ono, Patrick H. Madden
CF
2005
ACM
15 years 8 months ago
On the energy-efficiency of speculative hardware
Microprocessor trends are moving towards wider architectures and more aggressive speculation. With the increasing transistor budgets, energy consumption has become a critical desi...
Nana B. Sam, Martin Burtscher
CONEXT
2005
ACM
15 years 8 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
IWCMC
2010
ACM
15 years 8 months ago
Using connection expansion to reduce control traffic in MANETs
We consider the problem of control traffic overhead in MANETs with long-lived connections, operating under a reactive routing protocol (e.g. AODV). In such settings, control traff...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha
DAC
2005
ACM
15 years 8 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
« Prev « First page 2717 / 2910 Last » Next »