Sciweavers

417 search results - page 60 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
KCAP
2011
ACM
12 years 12 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 3 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
ICDT
2010
ACM
195views Database» more  ICDT 2010»
14 years 1 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich