In this work we present a performance study of modified Dynamic Beta RED (mDBetaRED), a new Active Queue Management (AQM) RED-type algorithm based on dynamical variants with the ability to adapt to the characteristics of mixed networks. As well, we rely ...

Evolutionary algorithms are a well-known optimisation technique. They can handle very different optimisation tasks and deal with distorted search spaces as well as non-differentiable optimisation functions. One crucial aspect in the design of ...

Evolutionary algorithms are stochastic algorithms so they tend to find different solutions when run repeatedly. However, it is not just the solutions that vary - the very dynamics of the search that led to finding these solutions are likely to differ ...

We present a simple and very efficient algorithm for string matching based on the combination of weak factor recognition and hashing. Despite its quadratic worst-case running time, our algorithm exhibits a sublinear behaviour. We also propose some ...

Modern Astrophysics is one of the most data intensive research fields in the world and is driving many of the required innovations in the "big data" space. Foremost in astronomy in terms of data generation is radio astronomy, and in the last decade an ...

In this paper we present a general approach to string matching based on multiple sliding text-windows, and show how it can be applied to some among the most efficient algorithms for the problem based on nondeterministic automata and comparison of ...

In this paper, we investigate {a} compact routing scheme with applications in static sensor networks and Internet. More precisely, we propose a new geometric ad-hoc routing algorithm to route queries in static {geometric graphs} in which the number of ...

A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by unlocking boxes where each box is associated with an unlocking cost. The ...

We investigate the problem of getting to a higher instruction-level parallelism in string matching algorithms. In particular, starting from an algorithm based on bit-parallelism, we propose two flexible approaches for boosting it with a higher level of ...

The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed.

In this paper, we present a new efficient algorithm for the Swap Matching problem with ...

The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern <em>P</em> in a text <em>T</em> , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every ...

We consider the complexity of computing a longest increasing subsequence parameterised by the length of the output. Namely, we show that the maximal length k of an increasing subsequence of a permutation of the set of integers -1, 2,..., n} can be ...

Helly's theorem says that, if every $d+1$ elements of a given finite set of convex objects in $\mathbb{R}^d$ have a common point, there is a point common to all of the objects in the set. In discrete Helly theorems the common point should belong to an a ...

We study the explicit deterministic treasure hunt problem in an n-vertex network. This problem was firstly introduced by Ta-Shma, and Zwick in [9] [SODA’07]. It is the variant of the well known rendezvous problem in which one of the robot (the ...

We study the explicit deterministic treasure hunt problem in an n-vertex network. This problem was firstly introduced by Ta-Shma, and Zwick in [9] [SODA'07]. It is the variant of the well known rendezvous problem in which one of the robot (the treasure) ...

The problem of extracting a basis of irredundant motifs from a sequence is considered. In previous work such bases were built incrementally for all suffixes of the input string s in O(n³), where n is the length of s. Faster, non-incremental algorithms ...

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes O(K(G)mn^1.5) time, where K(G) is the vertex connectivity of G. In this ...

In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of matching substrings. We first explore two well-known linearizing ...

We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the ...

Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is $\mathcal{NP}$-hard and all of the previously known heuristics lack proof ...