Data replication is used extensively in wide-area distributed systems to achieve low dataaccess latency. Minimizing the cost of the resources used for replication is a key problem in these systems. The paper proposes a method to calculate lower bounds for the replication cost required to achieve certain QoS goals. We obtain bounds for the general case as well as for certain classes of replica p...

We expose a method for extracting hyponyms and hypernyms from analytical definitions, focusing on the relation observed between hypernyms and relational adjectives (e.g., cardiovascular disease). These adjectives introduce a set of specialized features according to a categorization proper to a particular knowledge domain. For detecting these sequences of hypernyms associated to relational adjec...

This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework (GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as an online learning method which evolves heuristics while solving the problem. In other words, the system keeps on evolving heuristics for a problem instance until a good solution is found. The framework is tested on so...

The topic of this chapter is to provide foundations for “branching heuristics”. The whole field of “heuristics” is very diverse, and we will concentrate on a specific part, where developments in the last four decades can be comprised in what actually deserves to be called a “theory”. A full version of this chapter, containing all proofs and extensive examples, is available in [Kul08a]. The noti...

Abstract. The automatic motion or trajectory planning is essential for several tasks that lead to the autonomy increase of Unmanned Aerial Vehicles (UAVs). This work proposes a Dijkstra algorithm for fixed-wing UAVs trajectory planning. The navigation environments are represented by sets of visibility graphs constructed through the terrain elevations of these environments. Digital elevation mod...

The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...

In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function field and improve the previous bounds by a factor proportional to g with the help of new results. We thus obtain a faster method of computing regulators and class numbers. Furthermore, we provide experimental data and heuristics on...

Learning Object Metadata (LOM) intends to facilitate the retrieval and reuse of learning material. However, the fastidious task of authoring them limits their use. Motivated by this issue, we introduce an original method for LOM generation based on relations between LOM documents. These relations significantly influence the attribute values. We formulate this influence with heuristics of acquis...