Sciweavers

95 search results - page 8 / 19
» Declarative modeling of finite mathematics
Sort
View
ICSEA
2007
IEEE
14 years 1 months ago
A Novel Framework for Test Domain Reduction using Extended Finite State Machine
Test case generation is an expensive, tedious, and errorprone process in software testing. In this paper, test case generation is accomplished using an Extended Finite State Machi...
Nutchakorn Ngamsaowaros, Peraphon Sophatsathit
GLOBECOM
2008
IEEE
13 years 7 months ago
Analysis of Load-Balanced Switch with Finite Buffers
Recently the Birkhoff-von Neumann load-balanced (LB) switch has become a promising switch design due to its high scalability properties and simple control. The performance of the L...
Yury Audzevich, Yoram Ofek, Miklós Telek, B...
MOC
2011
13 years 2 months ago
An optimal adaptive mixed finite element method
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
Carsten Carstensen, Hella Rabus
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
LOPSTR
1994
Springer
13 years 11 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle