Sciweavers

1263 search results - page 33 / 253
» A* with Bounded Costs
Sort
View
JMLR
2006
134views more  JMLR 2006»
14 years 9 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
109
Voted
TKDE
2008
169views more  TKDE 2008»
14 years 9 months ago
A Cost-Based Approach to Adaptive Resource Management in Data Stream Systems
Data stream management systems need to control their resources adaptively since stream characteristics and query workload may vary over time. In this paper we investigate an approa...
Michael Cammert, Jürgen Krämer, Bernhard...
MFCS
2004
Springer
15 years 3 months ago
The Price of Anarchy for Polynomial Social Cost
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
Martin Gairing, Thomas Lücking, Marios Mavron...
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
14 years 9 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
14 years 9 months ago
A Note on a Problem of Hilliker and Straus
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
Miroslawa Janczak