3082 search results - page 384 / 617 » New Bounds for the Controller Problem |
218
click to vote
JUCS
2010
15 years 5 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
177
click to vote
TCC
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
183
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
155
click to vote
TAPSOFT
1993
Springer
15 years 10 months ago
1993
Springer
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
196
click to vote
AIPS
2010
15 years 7 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...