Sciweavers

3131 search results - page 197 / 627
» Generalized connection caching
Sort
View
74
Voted
ECAL
2005
Springer
15 years 6 months ago
On a Quantitative Measure for Modularity Based on Information Theory
The concept of modularity appears to be crucial for many questions in the field of Artificial Life research. However, there have not been many quantitative measures for modularit...
Daniel Polani, Peter Dauscher, Thomas Uthmann
100
Voted
ICLP
2001
Springer
15 years 5 months ago
A Multi-adjoint Logic Approach to Abductive Reasoning
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotonic logic programs [2, 3], in that simultaneous use of several implications in the ru...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
93
Voted
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
15 years 5 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani
93
Voted
ECAI
1998
Springer
15 years 5 months ago
Nonmonotonic Reasoning in Probabilistics
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...
Gabriele Kern-Isberner
106
Voted
AUSAI
2006
Springer
15 years 4 months ago
An Analysis of Three Puzzles in the Logic of Intention
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...
Wayne Wobcke