Sciweavers

263 search results - page 44 / 53
» Regret Bounds for Prediction Problems
Sort
View
ECRTS
2009
IEEE
13 years 7 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
COMPGEOM
2003
ACM
14 years 3 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
14 years 10 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
AIPS
2010
14 years 7 days ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
COR
2008
122views more  COR 2008»
13 years 10 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr