8413 search results - page 495 / 1683 » Ordering Problem Subgoals |
189
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
194
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
184
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
188
click to vote
DASFAA
2006
IEEE
15 years 10 months ago
2006
IEEE
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
164
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...