Sciweavers

15792 search results - page 3 / 3159
» Computational Abstraction Steps
Sort
View
STACS
1999
Springer
13 years 9 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
CEC
2005
IEEE
13 years 11 months ago
Real-parameter optimization using the mutation step co-evolution
Abstract- An evolutionary algorithm for the optimization of a function with real parameters is described in this paper. It uses a cooperative co-evolution to breed and reproduce su...
Petr Posik
COMMA
2006
13 years 6 months ago
First Steps Towards the Automatic Construction of Argument-Diagrams from Real Discussions
Abstract. This paper presents our efforts to create argument structures from meeting transcripts automatically. We show that unit labels of argument diagrams can be learnt and pred...
Daan Verbree, Rutger Rienks, Dirk Heylen
ICCS
2004
Springer
13 years 10 months ago
Reuse of Paths in Final Gathering Step with Moving Light Sources
Abstract. In this paper we extend our previous result on reusing shooting paths when dealing with moving light sources in radiosity to the final gathering step algorithm, which co...
Mateu Sbert, Francesc Castro
JUCS
2010
134views more  JUCS 2010»
13 years 3 months ago
Newton Method for Nonlinear Dynamic Systems with Adaptive Time Stepping
Abstract: This paper presents a nonlinear solver based on the Newton-Krylov methods, where the Newton equations are solved by Krylov-subspace type approaches. We focus on the solut...
Wensheng Shen, Changjiang Zhang, Jun Zhang, Xiaoqi...