Sciweavers

22128 search results - page 4142 / 4426
» Research in Structural Computing
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
16 years 1 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
GECCO
2009
Springer
16 years 1 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
ICCS
2009
Springer
16 years 1 months ago
A Scalable and Adaptable Solution Framework within Components of the Community Climate System Model
Abstract. A framework for a fully implicit solution method is implemented into (1) the High Order Methods Modeling Environment (HOMME), which is a spectral element dynamical core o...
Katherine J. Evans, Damian W. I. Rouson, Andrew G....
IWPEC
2009
Springer
16 years 1 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
MHCI
2009
Springer
16 years 1 months ago
Exploring the use of landmarks for mobile navigation support in natural environments
Landmarks are a key element in navigation and have been used extensively to provide navigation support to pedestrians through mobile devices in urban areas. Natural environments d...
Caroline Snowdon, Christian Kray
« Prev « First page 4142 / 4426 Last » Next »