952 search results - page 180 / 191 » Computational complexity of stochastic programming problems |
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CN
2000
14 years 9 months ago
2000
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
73
Voted
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
100
click to vote
IWVF
2001
Springer
15 years 1 months ago
2001
Springer
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...