1686 search results - page 27 / 338 » Programs as polygraphs: computability and complexity |
PDPTA
2010
14 years 7 months ago
2010
The problem of programmability on modern heterogeneous multicore and future manycore embedded platforms is still not solved satisfactorily: although many existing but incompatible ...
116
click to vote
GECCO
2009
Springer
14 years 7 months ago
2009
Springer
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
MP
2008
14 years 9 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
ICTAI
2010
IEEE
14 years 7 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 ...
PPOPP
2012
ACM
13 years 5 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...