4164 search results - page 715 / 833 » Timing model reduction for hierarchical timing analysis |
164
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
169
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
173
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Today’s wirelessly networked embedded systems underlie a vast array of electronic devices, performing computation, communication, and input/output. A major design goal...
146
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
161
click to vote
SPAA
2005
ACM
15 years 12 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...