2944 search results - page 224 / 589 » Improving Bound Propagation |
153
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...
188
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
222
click to vote
SLS
2009
Springer
16 years 1 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
161
click to vote
RTSS
2005
IEEE
16 years 4 days ago
2005
IEEE
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
154
click to vote
FCT
2005
Springer
16 years 3 days ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...