Sciweavers

8512 search results - page 116 / 1703
» Computing Theory With Relevance
Sort
View
IBERAMIA
2004
Springer
14 years 1 months ago
Applying Rough Sets Reduction Techniques to the Construction of a Fuzzy Rule Base for Case Based Reasoning
Early work on Case Based Reasoning reported in the literature shows the importance of soft computing techniques applied to different stages of the classical 4-step CBR life cycle. ...
Florentino Fdez-Riverola, Fernando Díaz, Ju...
ECEASST
2010
13 years 5 months ago
GUI Inspection from Source Code Analysis
Abstract: Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. Th...
João Carlos Silva 0002, José Creissa...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg

Book
314views
15 years 6 months ago
Programming in Martin-Löf's Type Theory
"This book describes different type theories (theories of types, polymorphic and monomorphic sets, and subsets) from a computing science perspective. It is intended for resear...
Bengt Nordström, Kent Petersson, Jan M. Smith
ICTCS
2003
Springer
14 years 1 months ago
Algebraic Theories for Contextual Pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
Roberto Bruni, José Meseguer, Ugo Montanari...