Sciweavers

4372 search results - page 156 / 875
» Algorithmic Theories of Everything
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 11 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
ICGA
2006
312views Optimization» more  ICGA 2006»
15 years 9 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
ISMVL
2009
IEEE
161views Hardware» more  ISMVL 2009»
14 years 3 months ago
Mining Approximative Descriptions of Sets Using Rough Sets
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
Dan A. Simovici, Selim Mimaroglu
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 3 months ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...
ER
2004
Springer
103views Database» more  ER 2004»
14 years 2 months ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia