Results 1 
6 of
6
LEDA: A Platform for Combinatorial and Geometric Computing
, 1999
"... We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical ..."
Abstract

Cited by 728 (46 self)
 Add to MetaCart
We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. We discuss our motivation for building LEDA and to what extent we have reached our goals. We also discuss some recent theoretical developments. This paper contains no new technical material. It is intended as a guide to existing publications about the system. We refer the reader also to our webpages for more information.
A Comparison of Encodings and Algorithms for Multiobjective Minimum Spanning Tree Problems
 In Proceedings of the 2001 Congress on Evolutionary Computation (CEC'01
, 1997
"... this paper we apply (appropriately modified) the best of recent methods for the (degreeconstrained) single objective MST problem to the multiobjective MST problem, and compare with a method based on Zhou and Gen's approach. Our evolutionary computation approaches, using the different encodings ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
this paper we apply (appropriately modified) the best of recent methods for the (degreeconstrained) single objective MST problem to the multiobjective MST problem, and compare with a method based on Zhou and Gen's approach. Our evolutionary computation approaches, using the different encodings, involve a new populationbased variant of Knowles and Corne's PAES algorithm. We find the direct encoding to considerably outperform the Prufer encoding. And we find that a simple iterated approach, based on Prim's algorithm modified for the multiobjective MST, also significantly outperforms the Prufer encoding.
Data Structures and Algorithms
 IN ENCYLOPEDIA OF ELECTRICAL AND ELECTRONIC ENGINEERING, JOHN WILEY AND SONS.
"... In this article we provide an introduction to data structures and algorithms. We consider some basic data structures and deal with implementations of a dictionary and a priority queue. Algorithms for such basic problems as matrix multiplication, binary search, sorting, and selection are given. The c ..."
Abstract
 Add to MetaCart
In this article we provide an introduction to data structures and algorithms. We consider some basic data structures and deal with implementations of a dictionary and a priority queue. Algorithms for such basic problems as matrix multiplication, binary search, sorting, and selection are given. The concepts of randomized computing and parallel computing are also visited.
Design Process Modularization: Concept and Algorithm
"... Abstract: The product design process is a complex set of integrated efforts, including generating ideas, developing concepts, modifying details, and evaluating proper solutions. The difficulties in designing complex products stem not only from their engineering complexity but also from the manageria ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: The product design process is a complex set of integrated efforts, including generating ideas, developing concepts, modifying details, and evaluating proper solutions. The difficulties in designing complex products stem not only from their engineering complexity but also from the managerial complexity. First and foremost, what should be done to deal with the complexity problems is to capture all the constituent design activities and identify interdependency among respective activities. Further, once process modeling is done, it is required to structure the design process for better understanding of the process. This study presents a new approach to structuring the design process on the basis of modular synthesis. To do this, the concept of a module is newly proposed in the view point of a process. A module is defined as a group of activities which are divided by split or merge points in a process flow. The design structure matrix (DSM) is used to structure the process because it has a lot of advantages in process modeling and analysis. Two algorithms are developed: the restricted topological sorting (RTS)
APPROVED FOR PUBLIC RELEASE
, 2001
"... Overthehorizon radar (OTHR) and microwave radar networks can together generate track data over a wide surveillance region. However the data is often subject to ambiguity and uncertainty due to the complexities of the HF signal propagation environment, which give rise to multipath OTHR tracks, as w ..."
Abstract
 Add to MetaCart
(Show Context)
Overthehorizon radar (OTHR) and microwave radar networks can together generate track data over a wide surveillance region. However the data is often subject to ambiguity and uncertainty due to the complexities of the HF signal propagation environment, which give rise to multipath OTHR tracks, as well as ambiguities in target associations between multiple microwave radars. This report describes an association and fusion algorithm which deals with both sources of uncertainty. The algorithm is capable of fusing OTHR multipath tracks and nonOTHR tracks (e.g. microwave radar or GPS), as well as dealing with multipath tracks from OTHR networks. The algorithm achieves this through a very general, model based, approach which deals with multipath effects as well as asynchronicity between sources of data. Importantly, the approach incorporates track history in its computation of association probabilities and fused estimate calculations, thus exploiting temporal as well as instantaneous spatial relationships between tracks. APPROVED FOR PUBLIC RELEASE DSTO–RR–0223 ii Published by
The LooPo scanner and parser
, 1995
"... The LooPo scanner and parser converts a source program containing loops, statements and dependencies into a tree and a list structure to be used by loop transformation algorithms. Contents 1 Introduction 1 1.1 Purpose : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Invoca ..."
Abstract
 Add to MetaCart
(Show Context)
The LooPo scanner and parser converts a source program containing loops, statements and dependencies into a tree and a list structure to be used by loop transformation algorithms. Contents 1 Introduction 1 1.1 Purpose : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 Invocation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2 The source language 1 2.1 The loops and statements part : : : : : : : : : : : : : : : : : : : : : 1 2.2 The dependence part : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2.3 An example source program : : : : : : : : : : : : : : : : : : : : : : : 2 2.4 A formal definition of the source language : : : : : : : : : : : : : : : 3 3 The implementation 3 3.1 The symbol table : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 3.1.1 The definition : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 3.1.2 The implementation : : : : : : : : : : : : : : : : : : : : : : : 6 3.2 The scanner : : : : : : : ...