121 search results - page 14 / 25 » Optimizing polynomials for floating-point implementation |
111
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
GECCO
1999
Springer
15 years 2 months ago
1999
Springer
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper formulates a two-dimensional, piecewise-cubic interpolator that accounts for non-separable and rotationally asymmetric scene statistics. The resulting kernel has five p...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...