952 search results - page 103 / 191 » Computational complexity of stochastic programming problems |
127
click to vote
HPCA
2006
IEEE
16 years 3 months ago
2006
IEEE
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
115
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
214
click to vote
SOFTWARE
2011
14 years 9 months ago
2011
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
142
Voted
ICDCS
1998
IEEE
15 years 7 months ago
1998
IEEE
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...
107
click to vote
MP
2008
15 years 2 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...