730 search results - page 24 / 146 » Combinatorics of Monotone Computations |
PRDC
2006
IEEE
14 years 2 months ago
2006
IEEE
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
ICDCS
2003
IEEE
14 years 1 months ago
2003
IEEE
Remotely executing mobile code introduces a plethora of security problems. This paper examines the “external agent replay” attack, identifies the notion of one-way program st...
GMP
2002
IEEE
14 years 1 months ago
2002
IEEE
We present an algorithm for computing Minkowski sums among surfaces of revolution and surfaces of linear extrusion, generated by slope-monotone closed curves. The special structur...
COMBINATORICS
2007
13 years 8 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
COMBINATORICS
1999
13 years 8 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...