3204 search results - page 447 / 641 » The b-chromatic Number of a Graph |
183
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
184
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
163
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
149
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
154
click to vote
ISLPED
1995
ACM
15 years 10 months ago
1995
ACM
Abstract: We describe a technique to estimate the energy consumed by speed-independent asynchronous (clockless) control circuits. Because speed-independent circuits are hazard-free...