749 search results - page 64 / 150 » Combinatory Models and Symbolic Computation |
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
ISPAN
2002
IEEE
14 years 2 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
COMPGEOM
1997
ACM
14 years 2 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
ICIAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. With the adoption of tablet-based data entry devices, there is considerable interest in methods for converting hand-drawn sketches of flow charts, graphs and block diagr...
STACS
1992
Springer
14 years 2 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...