438 search results - page 2 / 88 » On Perfect Switching Classes |
FCT
2011
Springer
12 years 5 months ago
2011
Springer
INFOCOM
2009
IEEE
14 years 1 days ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
DM
1998
13 years 5 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
COCO
2010
Springer
13 years 2 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— This paper addressed the computation of the L2-induced gain for a class of switched systems. The main contribution of the paper is to completely characterize the induced gain o...