1007 search results - page 29 / 202 » The Complexity of Futile Questioning |
COCO
2006
Springer
14 years 1 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
CC
2006
Springer
13 years 9 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
SUTC
2006
IEEE
14 years 3 months ago
2006
IEEE
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
ICTCS
2005
Springer
14 years 3 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...