1086 search results - page 10 / 218 » Jug measuring: Algorithms and complexity |
TCS
2008
13 years 9 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— An interferometric ranging technique has been recently proposed as a possible way to localize ad hoc and sensor networks. Compared to the more common techniques such as receive...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
WEBI
2009
Springer
14 years 4 months ago
2009
Springer
Abstract—Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches h...