Sciweavers

13306 search results - page 317 / 2662
» Theoretical Computer Science
Sort
View
KSEM
2010
Springer
15 years 5 months ago
A Comparison of Merging Operators in Possibilistic Logic
Abstract. In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that...
Guilin Qi, Weiru Liu, David A. Bell
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
16 years 1 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
ACMSE
2000
ACM
15 years 11 months ago
Exploring an information-based approach to computation and computational complexity
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
D. E. Stevenson
IJCINI
2007
96views more  IJCINI 2007»
15 years 6 months ago
The Theoretical Framework of Cognitive Informatics
Cognitive Informatics (CI) is a transdisciplinary enquiry of the internal information processing mechanisms and processes of the brain and natural intelligence shared by almost al...
Yingxu Wang
166
Voted
FOCS
1997
IEEE
15 years 11 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek