Sciweavers

2569 search results - page 11 / 514
» Approximate Objects and Approximate Theories
Sort
View
WG
2007
Springer
15 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
CIE
2005
Springer
15 years 3 months ago
Computability in Computational Geometry
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
Abbas Edalat, Ali Asghar Khanban, André Lie...
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
15 years 3 months ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus
81
Voted
RSCTC
2004
Springer
121views Fuzzy Logic» more  RSCTC 2004»
15 years 2 months ago
On the Correspondence between Approximations and Similarity
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
Patrick Doherty, Andrzej Szalas
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
15 years 4 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...