Sciweavers

551 search results - page 63 / 111
» Reducing the cost of applying adaptive test cases
Sort
View
POPL
1994
ACM
15 years 6 months ago
Dominators, Super Blocks, and Program Coverage
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
Hiralal Agrawal
APSCC
2009
IEEE
15 years 7 months ago
Extended policies for automatic service composition in IMS
— Service creation by composing existing services and/or network resources is considered by Telecom and Internet industries as the trend for service provisioning in Next Generati...
Cuiting Huang, Noël Crespi
TVLSI
2008
115views more  TVLSI 2008»
15 years 1 months ago
Outer Loop Pipelining for Application Specific Datapaths in FPGAs
Most hardware compilers apply loop pipelining to increase the parallelism achieved, but pipelining is restricted to the only innermost level in a nested loop. In this work we exten...
Kieron Turkington, Turkington A. Constantinides, K...
ICCS
2009
Springer
15 years 8 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 7 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor