IPL
2002
13 years 11 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
IPL
2002
13 years 11 months ago
2002
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
IPL
2002
13 years 11 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
IPL
2002
13 years 11 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...
IPL
2002
13 years 11 months ago
2002
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
IPL
2002
13 years 11 months ago
2002
We develop a formal semantics of sequence diagrams. The semantics is given in terms of our new temporal logic, named HDTL, which is designed to specify dynamically evolving system...
IPL
2002
13 years 11 months ago
2002
We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients w...
IPL
2002
13 years 11 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
IPL
2002
13 years 11 months ago
2002
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
IPL
2002
13 years 11 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...