949 search results - page 65 / 190 » Theory of Constraints |
111
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
140
Voted
CADE
2007
Springer
16 years 1 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
88
Voted
TON
2002
15 years 9 days ago
2002
The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket cont...
105
Voted
AUSAI
1999
Springer
15 years 5 months ago
1999
Springer
This paper analyzes the notion of a minimal belief change that incorporates new information. I apply the fundamental decisiontheoretic principle of Pareto-optimality to derive a no...
121
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...