361 search results - page 61 / 73 » Approximate counting by dynamic programming |
ISPD
2012
ACM
12 years 3 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
AAAI
2007
13 years 9 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
CF
2010
ACM
14 years 17 days ago
2010
ACM
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...