Sciweavers

3359 search results - page 18 / 672
» A Simplified Idea Algorithm
Sort
View
TEC
2002
119views more  TEC 2002»
13 years 7 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
ISSAC
2001
Springer
119views Mathematics» more  ISSAC 2001»
14 years 2 days ago
Algorithms for trigonometric polynomials
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
Jamie Mulholland, Michael B. Monagan
ALGORITHMICA
2005
95views more  ALGORITHMICA 2005»
13 years 7 months ago
Near-Linear Time Approximation Algorithms for Curve Simplification
Abstract. We consider the problem of approximating a polygonal curve
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...
CGO
2004
IEEE
13 years 11 months ago
Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
Rahul Joshi, Michael D. Bond, Craig B. Zilles
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 9 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe