Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Collective adaptive systems (CASs) have been researched intensively since many years. However, the recent emerging developments and advanced models in service-oriented computing, cloud computing and human computation have fostered several new forms of CASs. Among them, Hybrid and Diversityaware CASs (HDA-CASs) characterize new types of CASs in which a collective is composed of hybrid machines a...

Currently, eating disorders (ED) refers to as «diseases of civilization» and the most important component in the development and progression of obesity in all age groups. Many studies conducted in the Americas, Europe, Russia indicate the increasing role of food programming, which is the basis for the formation of ED and determines the characteristics of the metabolism of an individual, the wei...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

This paper describes current work on the application of visual techniques to the design and construction ofparallel ana’distn’butedprograms. In particular, we look at how the sofhvare architectural view can be effectively utilised to provide a common framework for integrating the various sofhoare development activities, ranging from early, informal program design to the evolution of the running...

This paper introduces the research status of convex quadratic bilevel programming at present firstly. Secondly, it analyzes the problem of convex quadratic bilevel programming models, concepts and properties. On this basis, using the optimality conditions of KKT, the problem will be transformed into a single complementary slackness relaxation problem. To solve this problem, we propose an orthog...

With the increasing role of electronic commerce in business applications, much attention is paid to online-auctions. As auctions become more and more popular in electronic commerce, agents face the problem of participating in multiple independent auctions simultaneously or in sequence. Decision making of agents becomes difficult when they have to buy bundles of goods. In this case the agents ha...

In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic decision procedure for Epigram’s in-built equality at each type, taking a complementary approach to that of Benke, Dybjer and Jansson [7]. We also give a generic definition of map, taking our inspiration from Jansson and Jeur...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...