1355 search results - page 189 / 271 » Alternating Timed Automata over Bounded Time |
141
click to vote
PVLDB
2008
15 years 2 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
150
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
139
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Screen readers, the dominant assistive technology used by visually impaired people to access the Web, function by speaking out the content of the screen serially. Using screen rea...
167
Voted
FOSSACS
2009
Springer
15 years 10 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
128
Voted
ACRI
2004
Springer
15 years 8 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...