7988 search results - page 1029 / 1598 » A Useful Undecidable Theory |
205
Voted
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
191
Voted
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
200
click to vote
CANDC
2009
ACM
15 years 11 months ago
2009
ACM
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
209
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
274
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...