1445 search results - page 63 / 289 » Uniformly Hard Languages |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
ENTCS
2008
13 years 10 months ago
2008
State-of-the-art security mechanisms are often enforced in isolation from each other, which limits the kinds of policies that can be enforced in distributed and heterogeneous sett...
CPC
2006
13 years 10 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
ESWS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Controlled vocabularies of various kinds (e.g., thesauri, classification schemes) play an integral part in making Cultural Heritage collections accessible. The various in...
AIL
2007
13 years 10 months ago
2007
Legal codes, such as the Uniform Commercial Code (UCC) examined in this article, are good points of entry for AI and ontology work because of their more straightforward adaptabili...