Sciweavers

115 search results - page 5 / 23
» Generating All Sets With Bounded Unions
Sort
View
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 4 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
DAGSTUHL
2008
13 years 9 months ago
Complete Interval Arithmetic and its Implementation
: Let IIR be the set of closed and bounded intervals of real numbers. Arithmetic in IIR can be defined via the power set IPIR of real numbers. If divisors containing zero are exclu...
Ulrich W. Kulisch
RTA
2010
Springer
13 years 11 months ago
Termination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
CAD
2007
Springer
13 years 7 months ago
Boundary of the volume swept by a free-form solid in screw motion
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
Jarek Rossignac, J. J. Kim, S. C. Song, K. C. Suh,...
FASE
2009
Springer
14 years 2 months ago
Reducing the Costs of Bounded-Exhaustive Testing
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...