Sciweavers

11160 search results - page 242 / 2232
» Incompleteness in a General Setting
Sort
View
FLAIRS
2003
15 years 7 months ago
Improving the Representation Space through Exception-Based Learning
This paper addresses the problem of improving the representation space in a rule-based intelligent system, through exception-based learning. Such a system generally learns rules c...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu, Dori...
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 5 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
ENTCS
2008
83views more  ENTCS 2008»
15 years 5 months ago
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
Diletta Cacciagrano, Flavio Corradini, Jesú...
IJCIM
2007
82views more  IJCIM 2007»
15 years 5 months ago
Towards a classification framework for interoperability of enterprise applications
: Software applications interoperability is a challenge for modern enterprises. It needs establishing standards and protocols for data exchange between different enterprise systems...
Hervé Panetto
IJNSEC
2007
127views more  IJNSEC 2007»
15 years 5 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong