Sciweavers

210 search results - page 10 / 42
» Classical descriptive set theory as a refinement of effectiv...
Sort
View
BSL
2004
100views more  BSL 2004»
13 years 7 months ago
Forcing in proof theory
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
Jeremy Avigad
LICS
2007
IEEE
14 years 1 months ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
GRC
2008
IEEE
13 years 8 months ago
Fuzzy Preference Relation Rough Sets
Preference analysis is a class of important tasks in multi-criteria decision making. The classical rough set theory was generalized to deal with preference analysis by replacing e...
Qinghua Hu, Daren Yu, Congxin Wu
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 2 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day