Sciweavers

10997 search results - page 50 / 2200
» On the Structure of Complete Sets
Sort
View
QOSA
2010
Springer
14 years 2 months ago
Statistical Inference of Software Performance Models for Parametric Performance Completions
Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challengi...
Jens Happe, Dennis Westermann, Kai Sachs, Lucia Ka...
SAC
2008
ACM
13 years 9 months ago
Towards a complete SCM ontology: the case of ontologising RosettaNet
This paper presents a methodology to derive a Supply Chain Management Ontology based on the RosettaNet specification framework. A prototype to mechanically derive a core ontology ...
Armin Haller, Jedrzej Gontarczyk, Paavo Kotinurmi
HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 9 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
DCC
2001
IEEE
14 years 9 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
JSA
2000
175views more  JSA 2000»
13 years 9 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd