8824 search results - page 373 / 1765 » On the Complexity of Real Functions |
208
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
214
click to vote
KES
2008
Springer
15 years 7 months ago
2008
Springer
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
198
click to vote
SAC
2006
ACM
15 years 7 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
219
click to vote
JMLR
2012
13 years 10 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
309
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...