Sciweavers

1722 search results - page 183 / 345
» Generating Tests from Counterexamples
Sort
View
IMR
2003
Springer
14 years 2 months ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
MICRO
2000
IEEE
124views Hardware» more  MICRO 2000»
14 years 1 months ago
Calpa: a tool for automating selective dynamic compilation
Selective dynamic compilation systems, typically driven by annotations that identify run-time constants, can achieve significant program speedups. However, manually inserting ann...
Markus Mock, Craig Chambers, Susan J. Eggers
IPM
2007
69views more  IPM 2007»
13 years 9 months ago
Investigating sentence weighting components for automatic summarisation
The work described here initially formed part of a triangulation exercise to establish the effectiveness of the Query Term Order algorithm. The methodology produced subsequently p...
Shao Fen Liang, Siobhan Devlin, John Tait
JAIR
1998
97views more  JAIR 1998»
13 years 9 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
KBSE
2008
IEEE
14 years 3 months ago
Type-Checking Software Product Lines - A Formal Approach
—A software product line (SPL) is an efficient means to generate a family of program variants for a domain from a single code base. However, because of the potentially high numb...
Christian Kästner, Sven Apel