Sciweavers

1170 search results - page 71 / 234
» Between ends and fibers
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
16 years 9 days ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
HIPEAC
2010
Springer
15 years 9 months ago
Performance and Power Aware CMP Thread Allocation Modeling
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
Yaniv Ben-Itzhak, Israel Cidon, Avinoam Kolodny
EVOW
2010
Springer
15 years 6 months ago
Search-Based Procedural Content Generation
Recently, a small number of papers have appeared in which the authors implement stochastic search algorithms, such as evolutionary computation, to generate game content, such as le...
Julian Togelius, Georgios N. Yannakakis, Kenneth O...
ACSC
2009
IEEE
15 years 6 months ago
A Citation Analysis of the ACSC 2006-2008 Proceedings, with Reference to the CORE Conference and Journal Rankings
1 This paper compares the CORE rankings of computing conferences and journals to the frequency of citation of those journals and conferences in the Australasian Computer Science Co...
Raymond Lister, Ilona Box
ECSQARU
2009
Springer
15 years 6 months ago
Realizing Default Logic over Description Logic Knowledge Bases
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...
Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner