Sciweavers

828 search results - page 65 / 166
» Bounded Hairpin Completion
Sort
View
BROADNETS
2004
IEEE
14 years 1 months ago
Power Efficient Broadcast Scheduling with Delay Deadlines
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
14 years 1 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
14 years 1 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
GC
2008
Springer
13 years 10 months ago
On the Acyclic Chromatic Number of Hamming Graphs
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
Robert E. Jamison, Gretchen L. Matthews
COMBINATORICS
2007
59views more  COMBINATORICS 2007»
13 years 10 months ago
New Optimal Constant Weight Codes
In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by fill...
Igor Gashkov, D. Taub