Sciweavers

9842 search results - page 189 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EWC
2007
60views more  EWC 2007»
13 years 10 months ago
A simulation-based design paradigm for complex cast components
This paper describes and exercises a new design paradigm for cast components. The methodology integrates foundry process simulation, non-destructive evaluation (nde), stress analys...
Stéphane P. A. Bordas, James G. Conley, Bri...
BMCBI
2010
161views more  BMCBI 2010»
13 years 7 months ago
LTC: a novel algorithm to improve the efficiency of contig assembly for physical mapping in complex genomes
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
Zeev Frenkel, Etienne Paux, David I. Mester, Cathe...
JC
2011
87views more  JC 2011»
13 years 5 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
RE
2002
Springer
13 years 10 months ago
Relating Software Requirements and Architectures Using Problem Frames
Problem frames provide a means of analyzing and decomposing problems. They emphasise the world outside of the computer, helping the developer to focus on the problem domain, inste...
Jon G. Hall, Michael Jackson, Robin C. Laney, Bash...
WSC
1998
13 years 11 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill