Sciweavers

952 search results - page 93 / 191
» Computational complexity of stochastic programming problems
Sort
View
CPAIOR
2008
Springer
15 years 4 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
APPT
2009
Springer
15 years 9 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
WWW
2008
ACM
16 years 3 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen
SPIN
2001
Springer
15 years 7 months ago
Addressing Dynamic Issues of Program Model Checking
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
Flavio Lerda, Willem Visser
PDPTA
2010
15 years 21 days ago
Disciplined Multi-core Programming in C
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...
Pjotr Kourzanov, Orlando Moreira, Henk J. Sips