483 search results - page 68 / 97 » On perfectness of sums of graphs |
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
IWQOS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
FSTTCS
2004
Springer
14 years 2 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
ICS
1995
Tsinghua U.
14 years 6 days ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...