Sciweavers

2747 search results - page 408 / 550
» Non-oblivious Strategy Improvement
Sort
View
CSCLP
2008
Springer
15 years 29 days ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti
EVOW
2008
Springer
15 years 28 days ago
Enhancing Parameter Estimation of Biochemical Networks by Exponentially Scaled Search Steps
A fundamental problem of modelling in Systems Biology is to precisely characterise quantitative parameters, which are hard to measure experimentally. For this reason, it is common ...
Hendrik Rohn, Bashar Ibrahim, Thorsten Lenser, Tho...
EVOW
2008
Springer
15 years 28 days ago
Compound Particle Swarm Optimization in Dynamic Environments
Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compoun...
Lili Liu, Dingwei Wang, Shengxiang Yang
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 22 days ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
ISCAPDCS
2008
15 years 18 days ago
Accelerating Molecular Dynamics Simulations with GPUs
Molecular dynamics simulations are known to run for many days or weeks before completion. In this paper we explore the use of GPUs to accelerate a LennardJones-based molecular dyn...
John Paul Walters, Vidyananth Balu, Vipin Chaudhar...