Sciweavers

227 search results - page 37 / 46
» Linearly Parameterized Bandits
Sort
View
USENIX
2008
13 years 10 months ago
A Compacting Real-Time Memory Management System
We propose a real real-time memory management system called Compact-fit that offers both time and space predictability. Compact-fit is a compacting memory management system for al...
Silviu S. Craciunas, Christoph M. Kirsch, Hannes P...
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
13 years 10 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
AAAI
2006
13 years 9 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
CGF
2008
126views more  CGF 2008»
13 years 8 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
JMLR
2006
134views more  JMLR 2006»
13 years 8 months ago
Considering Cost Asymmetry in Learning Classifiers
Receiver Operating Characteristic (ROC) curves are a standard way to display the performance of a set of binary classifiers for all feasible ratios of the costs associated with fa...
Francis R. Bach, David Heckerman, Eric Horvitz