14165 search results - page 465 / 2833 » The generalized two-server problem |
182
click to vote
LOGCOM
2010
15 years 5 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
208
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
179
click to vote
SEMWEB
2007
Springer
16 years 1 months ago
2007
Springer
Methodologies to find and evaluate solutions for ontology matching should be centered on the practical problems to be solved. In this paper we look at matching from the perspectiv...
161
click to vote
ISAAC
2005
Springer
16 years 12 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
135
click to vote
COLT
2004
Springer
16 years 9 days ago
2004
Springer
We define the problem of inferring a “mixture of Markov chains” based on observing a stream of interleaved outputs from these chains. We show a sharp characterization of the i...