1204 search results - page 110 / 241 » Termination of Polynomial Programs |
136
click to vote
ICLP
2010
Springer
14 years 11 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
133
Voted
GECCO
2011
Springer
14 years 4 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
119
Voted
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
145
click to vote
ARITH
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
111
click to vote
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...