Sciweavers

1263 search results - page 138 / 253
» A* with Bounded Costs
Sort
View
COLT
2006
Springer
14 years 1 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
IOR
2008
91views more  IOR 2008»
13 years 9 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
12 years 9 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 3 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
PVLDB
2010
92views more  PVLDB 2010»
13 years 8 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi