420 search results - page 6 / 84 » Some Algorithmic Problems in Polytope Theory |
CORR
1998
Springer
13 years 7 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
COMPGEOM
2010
ACM
14 years 16 days ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
13 years 7 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...