Sciweavers

2041 search results - page 386 / 409
» Balance Machines: Computing = Balancing
Sort
View
DAC
2008
ACM
16 years 26 days ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung
DAC
2004
ACM
16 years 25 days ago
A frequency relaxation approach for analog/RF system-level simulation
The increasing complexity of today's mixed-signal integrated circuits necessitates both top-down and bottom-up system-level verification. Time-domain state-space modeling and...
Xin Li, Yang Xu, Peng Li, Padmini Gopalakrishnan, ...
WWW
2003
ACM
16 years 16 days ago
P2Cast: peer-to-peer patching scheme for VoD service
Providing video on demand (VoD) service over the Internet in a scalable way is a challenging problem. In this paper, we propose P2Cast - an architecture that uses a peer-to-peer a...
Yang Guo, Kyoungwon Suh, James F. Kurose, Donald F...
ASPLOS
2009
ACM
16 years 15 days ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
ICALP
2009
Springer
16 years 4 days ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao