952 search results - page 99 / 191 » Computational complexity of stochastic programming problems |
130
click to vote
CHARME
2003
Springer
15 years 8 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
130
click to vote
CCGRID
2007
IEEE
15 years 9 months ago
2007
IEEE
Traditional parallel programming styles have many problems which hinder the development of parallel applications. The message passing style can be too complex for many programmers...
116
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
138
click to vote
CEC
2010
IEEE
14 years 6 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...
156
click to vote
RIVF
2008
15 years 4 months ago
2008
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...