952 search results - page 52 / 191 » Computational complexity of stochastic programming problems |
187
Voted
POPL
2008
ACM
16 years 23 days ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
109
click to vote
EUROCAST
2007
Springer
15 years 4 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
207
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
84
Voted
HUMAN
2003
Springer
15 years 5 months ago
2003
Springer
Perfect protection against all system threats is considered to be impossible. The problem of monitoring against the threats has been an issue in literature, but its progress has no...