Sciweavers

15033 search results - page 208 / 3007
» Complexity Theory and Algorithms
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
CP
2004
Springer
15 years 9 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 4 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
FLAIRS
2006
15 years 5 months ago
Coalition Formation Meets Information Theory
The process of coalition formation, where distinct autonomous agents come together to act as a coherent group is an important form of interaction in multiagent systems. Previous w...
Victor Palmer, Thomas R. Ioerger
ICIP
2008
IEEE
15 years 11 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao