249 search results - page 47 / 50 » The upper bound on k-tuple domination numbers of graphs |
AAAI
2010
13 years 8 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
AAAI
2006
13 years 8 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
TPDS
2010
13 years 5 months ago
2010
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
CPM
2004
Springer
14 years 22 days ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...