Sciweavers

1215 search results - page 224 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
ECML
2004
Springer
13 years 10 months ago
Naive Bayesian Classifiers for Ranking
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...
Harry Zhang, Jiang Su
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 1 months ago
Query Expansion Based on Clustered Results
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen
DAGSTUHL
2007
13 years 8 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
PODC
2010
ACM
13 years 10 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
FOSSACS
2011
Springer
12 years 10 months ago
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
Shulamit Halamish, Orna Kupferman