3229 search results - page 380 / 646 » The Theory of Timed Automata |
178
click to vote
AUSAI
2005
Springer
16 years 9 days ago
2005
Springer
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
160
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
185
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
183
click to vote
CIAC
2003
Springer
16 years 4 hour ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
205
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...