2095 search results - page 106 / 419 » Improved pebbling bounds |
159
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
98
Voted
ATS
2005
IEEE
15 years 6 months ago
2005
IEEE
— Structural transformation of a design to enhance its testability while satisfying design constraints on power and performance, can result in improved test cost and test confid...
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
88
Voted
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
—Designing high-performance systems with high yield under parameter variations has raised serious design challenges in nanometer technologies. In this paper, we propose a profit-...
106
click to vote
HM
2010
Springer
15 years 29 days ago
2010
Springer
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...