Results 11  20
of
93
Rectilinear Full Steiner Tree Generation
 NETWORKS
, 1997
"... The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic p ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
(Show Context)
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a twophase scheme: First a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic programming or an integer programming formulation. FST generation methods can be seen as problem reduction algorithms and are also useful as a first step in providing good upper and lowerbounds for large instances. Currently, the time needed to generate FSTs poses a significant overhead for FST based exact algorithms. In this paper we present a very efficient algorithm for the rectilinear FST generation problem which removes this overhead completely. Based on information obtained in a preprocessing phase, the new algorithm "grows" FSTs while applying several new and important optimality conditions. For randomly generated instances approximately 4n FSTs are generated (where n is the number o...
Towards Multidimensional Subspace Skyline Analysis
"... The skyline operator is important for multicriteria decisionmaking applications. Although many recent studies developed efficient methods to compute skyline objects in a given space, none of them considers skylines in multiple subspaces simultaneously. More importantly, the fundamental ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
(Show Context)
The skyline operator is important for multicriteria decisionmaking applications. Although many recent studies developed efficient methods to compute skyline objects in a given space, none of them considers skylines in multiple subspaces simultaneously. More importantly, the fundamental
V.G.: “Delay optimization of carryskip adders and block carrylookahead adders
 Proc. of Int’l Symposium on Computer Arithmetic
, 1991
"... AbstractThe worstcase carry propagation delays in carryskip adders and block carrylookahead adders depend on how the full adders are grouped structurally together into blocks as well as the number of levels. We report on a multidimensional dynamic programming paradigm for configuring these two ad ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
AbstractThe worstcase carry propagation delays in carryskip adders and block carrylookahead adders depend on how the full adders are grouped structurally together into blocks as well as the number of levels. We report on a multidimensional dynamic programming paradigm for configuring these two adders to attain minimum latency. Previous methods are applicable only to very limited delay models that do not guarantee a minimum latency configuration. Under our delay model, critical path delay is calculated not only taking into account the intrinsic gate delays, but also the fanin and fanout contributions. Index TermsBlock carrylookahead adders, carryskip adders, CMOS, computer arithmetic, delay optimization, multidimensional dynamic programming, VLSI design.
On the Complexity of QoS Routing
 Computer Communications
, 2003
"... We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. Because SAMCRA is an exact algorithm, its complexity also characterizes that of QoS routing in general. The complexity of SAMCRA is simulated in specific classes of graphs. Since the comp ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
(Show Context)
We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. Because SAMCRA is an exact algorithm, its complexity also characterizes that of QoS routing in general. The complexity of SAMCRA is simulated in specific classes of graphs. Since the complexity of an algorithm involves a scaling of relevant parameters, the second part of this paper analyses how routing with multiple independent link weights affects the hopcount distribution. Both the complexity and the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to singleparameter routing. These results suggest that there may exist classes of graphs in which QoS routing is not NPcomplete.
Techniques for highly multiobjective optimisation: Some nondominated points are better than others
 in Proceedings GECCO 2007. ACM
, 2007
"... The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much evidence of their worth in practical scenarios. An urgent emerging issue is that the favoured EMO algorithms scale poorly ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
The research area of evolutionary multiobjective optimization (EMO) is reaching better understandings of the properties and capabilities of EMO algorithms, and accumulating much evidence of their worth in practical scenarios. An urgent emerging issue is that the favoured EMO algorithms scale poorly when problems have ‘many ’ (e.g. five or more) objectives. One of the chief reasons for this is believed to be that, in manyobjective EMO search, populations are likely to be largely composed of nondominated solutions. In turn, this means that the commonlyused algorithms cannot distinguish between these for selective purposes. However, there are methods that can be used validly to rank points in a nondominated set, and may therefore usefully underpin selection in EMO search. Here we discuss and compare several such methods. Our main finding is that simple variants of the oftenoverlooked ‘Average Ranking ’ strategy usually outperform other methods tested, covering problems with 5—20 objectives and differing amounts of interobjective correlation. Categories and Subject Descriptors I.2.8 [Problem solving, control methods and search]: Heuristic methods
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
 Discrete Applied Mathematics
, 1998
"... The rectilinear Steiner tree problem is to find a minimumlength rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rec ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
The rectilinear Steiner tree problem is to find a minimumlength rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rectilinear problem. Furthermore, anumber of more direct, geometric algorithms have been devised for computing optimal rectilinear Steiner trees. This paper surveys algorithms for computing optimal rectilinear Steiner trees and presents experimental results comparing nine of them: graph Steiner tree algorithms due to Beasley, Bern, Dreyfus and Wagner, Hakimi, and Shore, Foulds, and Gibbons and geometric algorithms due to Ganley and Cohoon, Salowe and Warme, and Thomborson, Alpern, and Carter. 1 Introduction The rectilinear Steiner tree (RST) problem is stated as follows: given a set T of n points called terminals in the plane, find a set S of additional points called Steiner points such tha...
Skyline with presorting: Theory and optimization
 In Int. Inf. Sys. Conference (IIS
, 2005
"... Abstract. There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for “best ” tuples, beyond the order by statement. The proposed skyline operator allows one to query for best tuples with respect to an ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
Abstract. There has been interest recently in skyline queries, also called Pareto queries, on relational databases. Relational query languages do not support search for “best ” tuples, beyond the order by statement. The proposed skyline operator allows one to query for best tuples with respect to any number of attributes as preferences. In this work, we explore what the skyline means, and why skyline queries are useful, particularly for expressing preference. We describe the theoretical aspects and possible optimizations of an efficiant algorithm for computing skyline queries presented in [6]. 1
Eliciting matters  controlling skyline sizes by incremental integration of user preferences
 In Proceedings of the 12th International Conference on Database Systems for Advanced Applications (DASFAA
, 2007
"... Abstract. Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental recomputation of skylines based on additional information elicited from the user. Extending the traditional case of totally ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Today, result sets of skyline queries are unmanageable due to their exponential growth with the number of query predicates. In this paper we discuss the incremental recomputation of skylines based on additional information elicited from the user. Extending the traditional case of totally ordered domains, we consider preferences in their most general form as strict partial orders of attribute values. After getting an initial skyline set our basic approach aims at interactively increasing the system’s information about the user’s wishes explicitly including indifferences. The additional knowledge then is incorporated into the preference information and constantly reduces skyline sizes. In fact, our approach even allows users to specify tradeoffs between different query predicates, thus effectively decreasing the query dimensionality. We give theoretical proof for the soundness and consistence of the extended preference information and an extensive experimental evaluation of the efficiency of our approach. On average, skyline sizes can be considerably decreased in each elicitation step.
Counting colors in boxes
 In Proceedings of Symposium on Discrete Algorithms (SODA
, 2007
"... Let P be a set of n points in R d, so that each point is colored by one of C given colors. We present algorithms for preprocessing P into a data structure that efficiently supports queries of the form: Given an axisparallel box Q, count the number of distinct colors of the points of P ∩ Q. We prese ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
Let P be a set of n points in R d, so that each point is colored by one of C given colors. We present algorithms for preprocessing P into a data structure that efficiently supports queries of the form: Given an axisparallel box Q, count the number of distinct colors of the points of P ∩ Q. We present a general and relatively simple solution that has polylogarithmic query time and worstcase storage about O(n d). It is based on several interesting structural properties of the problem that we derive. We also show that for random inputs, the data structure requires almost linear expected storage. We then present several techniques for achieving spacetime tradeoff. In R 2, the most efficient solution uses fast matrix multiplication in the preprocessing stage. In higher dimensions we use simpler tradeoff mechanisms, which behave just as well. We give a reduction from matrix multiplication to the offline version of problem, which shows that in R 2 our timespace tradeoffs are close to optimal in the sense that improving them substantially would improve the best exponent of matrix multiplication. Finally, we present a generalized matrix multiplication problem and show its intimate relation to counting colors in boxes in any dimension. 1
Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets
 Journal of Algorithms
, 1983
"... An O(n log n) algorithm is presented for computing the maximum euclidean distance between two finite planar sets of n points. When the n points form the vertices of simple polygons this complexity can be reduced to O(n). The algorithm is empirically compared to the bruteforce method as well as an a ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
An O(n log n) algorithm is presented for computing the maximum euclidean distance between two finite planar sets of n points. When the n points form the vertices of simple polygons this complexity can be reduced to O(n). The algorithm is empirically compared to the bruteforce method as well as an alternate O(n 2 ) algorithm. Both the O(n log n) and O(n 2 ) algorithms run in O(n) expected time for many underlying distributions of the points. An eapproximate algorithm can be obtained that runs in O(n + 1/e) worstcase time. 1. Introduction Let S 1 = p 1 , p 2 ,..., p n and S 2 = q 1 , q 2 ,..., q n be two planar sets of n points, and let S = S 1 È S 2 . (The sets need not have equal cardinality, but this assumption simplifies notation.) A point p i is given by the cartesian coordinates x i and y i . The maximum distance between S 1 and S 2 , denoted by d max (S 1 , S 2 ), is defined as d max (S 1 , S 2 ) = {d(p i ,q j )}, i, j = 1,2,...,n, where d(p i ,q j ) is the euclidean dista...