9166 search results - page 1409 / 1834 » A framework for comparing models of computation |
189
click to vote
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
In a typical reinforcement learning (RL) setting details of the environment are not given explicitly but have to be estimated from observations. Most RL approaches only optimize th...
175
click to vote
CLEANDB
2006
ACM
15 years 10 months ago
2006
ACM
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
174
Voted
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
173
click to vote
ECAI
2006
Springer
2006
Springer
Identifying Inter-Domain Similarities Through Content-Based Analysis of Hierarchical Web-Directories
15 years 10 months ago
Providing accurate personalized information services to the users requires knowing their interests and needs, as defined by their User Models (UMs). Since the quality of the person...
176
Voted
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...