Sciweavers

101 search results - page 10 / 21
» Characterizing the Evolution of Class Hierarchies
Sort
View
TLCA
2007
Springer
14 years 1 months ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
IJCAI
2003
13 years 8 months ago
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
François Goasdoué, Marie-Christine R...
ICONIP
2009
13 years 5 months ago
Quasi-Deterministic Partially Observable Markov Decision Processes
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
Camille Besse, Brahim Chaib-draa
ISHPC
2003
Springer
14 years 19 days ago
Chordal Topologies for Interconnection Networks
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Ramón Beivide, Carmen Martínez, Cruz...