2128 search results - page 62 / 426 » A general characterization of indulgence |
182
click to vote
ECRTS
2008
IEEE
16 years 22 days ago
2008
IEEE
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fi...
136
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
A semimagic square of order n is an n ¢n matrix containing the integers 0 n2 1 arranged in such a way that each row and column add up to the same value. We generalize this notio...
157
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
160
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
156
click to vote
AAAI
2008
15 years 8 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...