Sciweavers

2905 search results - page 122 / 581
» Formal Memetic Algorithms
Sort
View
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
14 years 3 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
CVPR
2000
IEEE
14 years 2 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 2 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
BIBE
2004
IEEE
107views Bioinformatics» more  BIBE 2004»
14 years 1 months ago
Fast Parallel Molecular Algorithms for DNA-based Computation: Factoring Integers
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...
Weng-Long Chang, Michael (Shan-Hui) Ho, Minyi Guo
JAIR
2007
111views more  JAIR 2007»
13 years 10 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson