139 search results - page 23 / 28 » The Domatic Number of Regular Graphs |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
FORMATS
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
IJMC
2006
13 years 7 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...