Sciweavers

10568 search results - page 410 / 2114
» Computer Intelligence and Formalization
Sort
View
AAAI
1992
15 years 5 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
ATAL
2011
Springer
14 years 4 months ago
Multi-criteria argument selection in persuasion dialogues
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...
Thomas L. van der Weide, Frank Dignum, John-Jules ...
SEMWEB
2009
Springer
15 years 11 months ago
Computing Minimal Mappings
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
Fausto Giunchiglia, Vincenzo Maltese, Aliaksandr A...
IPPS
2000
IEEE
15 years 9 months ago
Optimal Periodic Remapping of Bulk Synchronous Computations on Multiprogrammed Distributed Systems
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
Ngo-Tai Fong, Cheng-Zhong Xu, Le Yi Wang
ICFP
1998
ACM
15 years 9 months ago
Functional Differentiation of Computer Programs
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...
Jerzy Karczmarczuk