Sciweavers

3143 search results - page 348 / 629
» Minimization of entropy functionals
Sort
View
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 12 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
KBSE
1998
IEEE
15 years 11 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
CODES
2007
IEEE
15 years 10 months ago
Influence of procedure cloning on WCET prediction
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
Paul Lokuciejewski, Heiko Falk, Martin Schwarzer, ...
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
ECIS
2001
15 years 8 months ago
Web Technologies and Value Innovation in the Italian Retail Banking Industry
Interpreting the outcome of a recent survey on Internet banking in Europe, [CARIGNANI et al., 2000], we point the attention to the adoption of Web technologies in Italian retail b...
Francesco Virili, Andrea Carignani