Sciweavers

1263 search results - page 96 / 253
» A* with Bounded Costs
Sort
View
FORMATS
2005
Springer
15 years 11 months ago
On Optimal Timed Strategies
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
Thomas Brihaye, Véronique Bruyère, J...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 10 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
CAAN
2004
Springer
15 years 10 months ago
The Efficiency of Optimal Taxes
It is well known that the selfish behavior of users in a network can be regulated through the imposition of the so-called optimal taxes on the network edges. Any traffic equilibriu...
George Karakostas, Stavros G. Kolliopoulos
QUESTA
2010
86views more  QUESTA 2010»
15 years 4 months ago
Dynamic admission and service rate control of a queue
This paper investigates a queueing system in which the controller can perform admission and service rate control. In particular, we examine a single server queueing system with Po...
Kranthi Mitra Adusumilli, John J. Hasenbein
NIPS
2007
15 years 7 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade