Recently, a new Web development technique for creating interactive Web applications,
dubbed Ajax, has emerged. In this new model, the single-page Web interface is composed …

Random walk is widely used in many graph analysis tasks, especially the first-order random
walk. However, as a simplification of real-world problems, the first-order random walk is poor …

Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to
be constructed that is the supersequence of a given string set. The SCS problem has an …

Background The problem of finding a Shortest Common Supersequence (SCS) of a set of
sequences is an important problem with applications in many areas. It is a key problem in …

Growing expressiveness of services increases the size of a manageable state at the network
data plane. A service policy is an ordered set of classification patterns (classes) with actions; …

An algorithmic analysis of Flood-it and Free-Flood-it on graph powers Page 1 Discrete
Mathematics and Theoretical Computer Science DMTCS vol. 16:3, 2014, 279–290 An …

The Shortest Common Supersequence Problem asks to obtain a shortest string that is a
supersequence of every member of a given set of strings. It has applications, among others …

This work presents new results on flood-filling games, Flood-It and Free-Flood-It, in which
the player aims to make the board monochromatic with a minimum number of flooding …

Abstract Simultaneous Multi-Threading (SMT) is a hardware model in which different threads
share the same processing unit. This model is a compromise between high parallelism and …

The idea behind this work is to solve the Shortest Common Supersequence by using
Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest …