173 search results - page 19 / 35 » Asymptotic classes of finite structures |
SIAMJO
2002
13 years 7 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
IJAC
2008
13 years 7 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
VISUALIZATION
1992
IEEE
13 years 11 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
SPAA
1990
ACM
13 years 11 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...