Sciweavers

19320 search results - page 180 / 3864
» On the complexity of computing determinants
Sort
View
EWC
2007
60views more  EWC 2007»
15 years 6 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...
ECAL
1995
Springer
15 years 10 months ago
Elements of a Theory of Simulation
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
Steen Rasmussen, Christopher L. Barrett
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
16 years 1 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
AC
2004
Springer
15 years 6 months ago
Shotgun Sequence Assembly
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
Mihai Pop