205 search results - page 6 / 41 » Efficient Algorithms for Universal Portfolios |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
FLAIRS
2008
14 years 11 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
FORMATS
2007
Springer
15 years 1 months ago
2007
Springer
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
SPAA
2010
ACM
14 years 9 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
ECCC
2010
14 years 9 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...