Sciweavers

1149 search results - page 97 / 230
» What Are Iteration Theories
Sort
View
CIMCA
2005
IEEE
14 years 2 months ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...
ATAL
2003
Springer
14 years 2 months ago
Distribution of goals addressed to a group of agents
The problem investigated in this paper is the distribution of goals addressed to a group of rational agents. Those agents are characterized by their ability (i.e. what they can do...
Laurence Cholvy, Christophe Garion
EJC
2008
13 years 9 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly
ENTCS
2008
64views more  ENTCS 2008»
13 years 9 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
FTTCS
2006
106views more  FTTCS 2006»
13 years 9 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami