Sciweavers

1675 search results - page 115 / 335
» The Value of a Good Name
Sort
View
ASPDAC
2008
ACM
169views Hardware» more  ASPDAC 2008»
14 years 2 days ago
Buffered clock tree synthesis for 3D ICs under thermal variations
In this paper, we study the buffered clock tree synthesis problem under thermal variations for 3D IC technology. Our major contribution is the Balanced Skew Theorem, which provides...
Jacob R. Minz, Xin Zhao, Sung Kyu Lim
ECAI
2008
Springer
13 years 11 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
AAAI
2006
13 years 11 months ago
A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments
Coalition formation is an important capability of automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered is...
Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki M...
PDPTA
2000
13 years 11 months ago
On the application of accelerating simulation methods in network analysis
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...
José Incera, Gerardo Rubino, Nicolás...
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
13 years 11 months ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest