16430 search results - page 515 / 3286 » On Computable Tree Functions |
158
click to vote
CIE
2006
Springer
15 years 9 months ago
2006
Springer
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
210
click to vote
IJBRA
2008
15 years 7 months ago
2008
: Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [2...
182
click to vote
INFORMATICALT
2006
15 years 7 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
180
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
212
click to vote
FBIT
2007
IEEE
16 years 1 months ago
2007
IEEE
—Standard genetic programming genotypes are generally highly disorganized and poorly structured, with little code replication. This is also true of existing developmental genetic...