Sciweavers

10568 search results - page 316 / 2114
» Computer Intelligence and Formalization
Sort
View
AAMAS
1999
Springer
15 years 3 months ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
118
Voted
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 3 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
118
Voted
FPL
2007
Springer
138views Hardware» more  FPL 2007»
15 years 10 months ago
Bringing High-Performance Reconfigurable Computing to Exact Computations
Numerical non-robustness is a recurring phenomenon in scientific computing. It is primarily caused by numerical errors arising because of fixed-precision arithmetic in integer and...
Esam El-Araby, Ivan Gonzalez, Tarek A. El-Ghazawi
168
Voted
IWFM
2003
172views Formal Methods» more  IWFM 2003»
15 years 5 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
ATAL
2008
Springer
15 years 5 months ago
Cognitive agents with non-monotonic reasoning
ended abstract provides an overview of my research towards a dissertation thesis in the context of programming cognitive agents with non-monotonic reasoning capabilities. Categori...
Peter Novák