All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 10 Next

Displaying 181 – 200 of 4962

Showing per page

A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem

Haris Gavranović, Mirsad Buljubašić (2013)

RAIRO - Operations Research - Recherche Opérationnelle

This paper presents a heuristic approach combining constraint satisfaction, local search and a constructive optimization algorithm for a large-scale energy management and maintenance scheduling problem. The methodology shows how to successfully combine and orchestrate different types of algorithms and to produce competitive results. We also propose an efficient way to scale the method for huge instances. A large part of the presented work was done to compete in the ROADEF/EURO Challenge 2010, organized...

A hybrid evolutionary approach to intelligent system design.

Amr Badr, Ibrahim Farag, Saad Eid (1999)

Mathware and Soft Computing

The problem of developing a general methodology for system design has always been demanding. For this purpose, an evolutionary algorithm, adapted with design-specific representation data structures is devised. The representation modeling the system to be designed, is composed of three levels of abstraction: the first, is an 'abstract brain' layer - mainly a number of competing finite state machines, which in turn control the second level composed of fuzzy Petri nets; the third level constitutes...

A Language Engineering Architecture for Processing Informal Mathematical Discourse

Wolska, Magdalena (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

We present a modular architecture for processing informal mathematical language as found in textbooks and mathematical publications. We point at its properties relevant in addressing three aspects of informal mathematical discourse: (i) the interleaved symbolic and natural language, (ii) the linguistic, domain, and notational context, and (iii) the imprecision of the informal language. The objective in the modular approach is to enable parameterisation of the system with respect to the natural language...

A language for expressing fuzzy temporal rules.

Purificación Cariñena, Alberto Bugarín, Manuel Mucientes, Senén Barro (2000)

Mathware and Soft Computing

This paper deals with the formal description of what we call Fuzzy Temporal Propositions: propositions with explicitly expressed information of a temporal type. The set of syntactic rules that make a grammar up for defining a language for this kind of propositions is presented. For some of the rules, examples that illustrate the expressive power of this type of knowledge representation are introduced. Semantic criteria and definitions are also introduced through examples in order to show how intuitive...

A learning algorithm combining functional discriminant coordinates and functional principal components

Tomasz Górecki, Mirosław Krzyśko (2014)

Discussiones Mathematicae Probability and Statistics

A new type of discriminant space for functional data is presented, combining the advantages of a functional discriminant coordinate space and a functional principal component space. In order to provide a comprehensive comparison, we conducted a set of experiments, testing effectiveness on 35 functional data sets (time series). Experiments show that constructed combined space provides a higher quality of classification of LDA method compared with component spaces.

A learning paradigm for motion control of mobile manipulators

Foudil Abdessemed, Eric Monacelli, Khier Benmahammed (2006)

International Journal of Applied Mathematics and Computer Science

Motion control of a mobile manipulator is discussed. The objective is to allow the end-effector to track a given trajectory in a fixed world frame. The motion of the platform and that of the manipulator are coordinated by a neural network which is a kind of graph designed from the kinematic model of the system. A learning paradigm is used to produce the required reference variables for each of the mobile platform and the robot manipulator for an overall coordinate behavior. Simulation results are...

A length bound for binary equality words

Jana Hadravová (2011)

Commentationes Mathematicae Universitatis Carolinae

Let w be an equality word of two binary non-periodic morphisms g , h : { a , b } * → Δ * with unique overflows. It is known that if w contains at least 25 occurrences of each of the letters a and b , then it has to have one of the following special forms: up to the exchange of the letters a and b either w = ( a b ) i a , or w = a i b j with gcd ( i , j ) = 1 . We will generalize the result, justify this bound and prove that it can be lowered to nine occurrences of each of the letters a and b .

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

Markov, Minko, Ionut Andreica, Mugurel, Manev, Krassimir, Tapus, Nicolae (2012)

Serdica Journal of Computing

ACM Computing Classification System (1998): G.2.2.We propose an algorithm that computes the length of a longest path in a cactus graph. Our algorithm can easily be modified to output a longest path as well or to solve the problem on cacti with edge or vertex weights. The algorithm works on rooted cacti and assigns to each vertex a two-number label, the first number being the desired parameter of the subcactus rooted at that vertex. The algorithm applies the divide-and-conquer approach and computes...

Currently displaying 181 – 200 of 4962