Sciweavers

606 search results - page 71 / 122
» words 2002
Sort
View
COMPSAC
2002
IEEE
14 years 2 months ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen
MP
2002
103views more  MP 2002»
13 years 9 months ago
Detecting Jacobian sparsity patterns by Bayesian probing
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
Andreas Griewank, Christo Mitev
GPEM
2002
163views more  GPEM 2002»
13 years 9 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
MP
2002
105views more  MP 2002»
13 years 9 months ago
Local behavior of an iterative framework for generalized equations with nonisolated solutions
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 F(z) + T (z), where T is a multifu...
Andreas Fischer
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 9 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...