4940 search results - page 300 / 988 » On the Complexity of Universal Programs |
255
click to vote
JUCS
2006
15 years 6 months ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...
187
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
177
click to vote
TSP
2010
15 years 1 months ago
2010
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
194
click to vote
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
183
click to vote
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
We present Dynamic Out-of-Order Java (DOJ), a dynamic parallelization approach. In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent executi...