Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleNovember 2000
Multiplicity and Local Search in Evolutionary Algorithms to Build the Pareto Front
SCCC '00: Proceedings of the XX International Conference of the Chilean Computer Science SocietyPage 7In multicriteria optimization determination of the Pareto-optimal front is of utmost importance for decision making. Simultaneous parallel search for multiple members of an evolutionary algorithm can lead to effective optimization. In a previous ...
- ArticleNovember 2000
Combining various algorithms to solve the ship berthing problem
Abstract: The Ship Berthing Problem (SBP) belongs to the category of NP-complete problems. In this paper we discuss the methods of representing the SBP with the use of a directed acyclic graph and the use of a acyclic list to represent valid solutions ...
- ArticleNovember 2000
Local search algorithm for the compacted cells area problem
Abstract: The minimum area joining of k compacted cells problem is an open problem that is not known whether to be polynomial-time solvable or NP-hard. In this paper we derive a divide-and-conquer approach for determining a lower-bound on the optimal ...
- ArticleNovember 2000
Constrained genetic algorithms and their applications in nonlinear constrained optimization
Abstract: The paper presents a problem-independent framework that unifies various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not necessarily differentiable and continuous. The framework is based ...
- ArticleNovember 2000
GA Tree: genetically evolved decision trees
Abstract: We use genetic algorithms to evolve classification decision trees. The performance of the system is measured on a set of standard discretized concept learning problems and compared (very favorably) with the performance of two known algorithms (...
- ArticleNovember 2000
Using heuristic-based optimizers to handle the personal computer configuration problems
Abstract: Given the diversity of PC hardware components, and the limited compatibility between some of these hardware components, most people are interested to obtain a (sub)optimal configuration for some specific usage restricted by their budget limits ...
- ArticleNovember 2000
About the use of local consistency in solving CSPs
Abstract: Local consistency is often a suitable paradigm for solving constraint satisfaction problems. We show how search algorithms could be improved, thanks to a smart use of two filtering techniques (path consistency and singleton arc consistency). ...
- ArticleNovember 2000
New data structures for orthogonal range searching
We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in R/sup 3/, we achieve query time O(log n+k) using space O(n log/sup 1+/spl epsiv// n), where n ...
- ArticleNovember 2000
Nearly optimal expected-case planar point location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision the probability that a query point lies within this polygon. The goal is to ...
- ArticleNovember 2000
Systematic testing of protocol robustness: case studies on mobile IP and MARS
Systematic testing of robustness by evaluation of synthesized scenarios STRESS is a methodology developed for the systematic testing of protocols, and includes algorithms for generating topologies and event sequences that rigorously test the correctness ...
- ArticleNovember 2000
Multi-dimensional prefix matching using line search
With the increasing popularity of firewalls, virtual private networks (VPNs) and quality of service (QoS) routing, packet classification becomes increasingly important in the Internet. The high-performance solutions known so far strongly rely on certain ...
- articleOctober 2000
The Complexity of Modular Graph Automorphism
SIAM Journal on Computing (SICOMP), Volume 30, Issue 4Pages 1299–1320https://doi.org/10.1137/S0097539799358227Motivated by the question of the relative complexities of the graph isomorphism and the graph automorphism problems, we define and study the modular graph automorphism problems. These are the decision problems modk-GA which consist, for each k > 1, of ...
- ArticleSeptember 2000
Fast Multipattern Search Algorithms for Intrusion Detection
Presents new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text characters among those of the pattern. This is a common requirement in intrusion ...
- research-articleJune 1998
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 9, Issue 6Pages 561–569https://doi.org/10.1109/71.689443A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to the right of the minimum in row i. Monotone matrices, and variations thereof, are known ...
- ArticleNovember 1997
On the optimal search problem: the case when the target distribution is unknown
SCCC '97: Proceedings of the 17th International Conference of the Chilean Computer Science SocietyPage 268We consider the problem of searching for an object in a set of N locations (or bins) (C/sub 1/,...,C/sub N/). The probability of the object being in the location C/sub i/ is p(i). Also, the probability of locating the object in the bin within a ...
- ArticleNovember 1997
Improving communication network topologies using tabu search
This paper proposes a tabu search approach for improving communication network topologies. The problem consists of finding, for a given set of nodes and traffic requirements, a network topology that minimizes the communication cost taking into account ...
- ArticleOctober 1997
Separation of the monotone NC hierarchy
We prove tight lower bounds, of up to n/sup /spl epsiv//, for the monotone depth of functions in monotone-P. As a result we achieve the separation of the following classes. 1. Monotone-NC/spl ne/monotone-P. 2. /spl forall/i/spl ges/1, monotone-NC/sup i//...
- ArticleApril 1997
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric and database applications. The authors describe the first non-trivial adaptation of range trees to the parallel ...
- ArticleAugust 1996
(R) An Efficient Algorithm for Row Minima Computations in Monotone Matrices
Abstract: A matrix A of size m/spl times/n containing items from a totally ordered universe is termed monotone if for every i, j, 1/spl les/i2. Our second contribution is to exhibit a number of non-trivial lower bounds for matrix search problems. These ...