Sciweavers

486 search results - page 82 / 98
» Improved upper bounds for 3-SAT
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 1 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
DATE
2010
IEEE
181views Hardware» more  DATE 2010»
14 years 1 months ago
Temperature-aware dynamic resource provisioning in a power-optimized datacenter
- The current energy and environmental cost trends of datacenters are unsustainable. It is critically important to develop datacenter-wide power and thermal management (PTM) soluti...
Ehsan Pakbaznia, Mohammad Ghasemazar, Massoud Pedr...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 26 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ISPD
2000
ACM
126views Hardware» more  ISPD 2000»
14 years 24 days ago
A practical clock tree synthesis for semi-synchronous circuits
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui,...