Sciweavers

12519 search results - page 350 / 2504
» Approximation Problems Categories
Sort
View
ATAL
2009
Springer
16 years 1 months ago
An empirical analysis of value function-based and policy search reinforcement learning
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...
Shivaram Kalyanakrishnan, Peter Stone
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
STACS
2007
Springer
16 years 24 days ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 7 months ago
Deriving evaluation metrics for applicability of genetic algorithms to optimization problems
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
Hsinyi Jiang, Carl K. Chang
CIVR
2009
Springer
132views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Real-time bag of words, approximately
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...