Sciweavers

4797 search results - page 430 / 960
» The complexity of partition tasks
Sort
View
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
16 years 11 days ago
Two Dimensional Parameterized Matching
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
202
Voted
ECAL
2005
Springer
16 years 11 days ago
(Co)Evolution of (De)Centralized Neural Control for a Gravitationally Driven Machine
Using decentralized control structures for robot control can offer a lot of advantages, such as less complexity, better fault tolerance and more flexibility. In this paper the ev...
Steffen Wischmann, Martin Hülse, Frank Pasema...
169
Voted
ICWE
2005
Springer
16 years 10 days ago
Modelling Adaptivity with Aspects
Modelling adaptive Web applications is a difficult and complex task. Usually, the development of general system functionality and context adaptation is intertwined. However, adapt...
Hubert Baumeister, Alexander Knapp, Nora Koch, Gef...
ISNN
2005
Springer
16 years 10 days ago
Applying Neural Networks and Geographical Information Systems to Airport Noise Evaluation
The assessment of aircraft noise is becoming an increasingly important task in ensuring sustainable airport development. Aircraft noise is influenced by many complex factors and tr...
Yingjie Yang, David Gillingwater, Chris J. Hinde
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 10 days ago
Half-GCD and fast rational recovery
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
Daniel Lichtblau