952 search results - page 135 / 191 » Computational complexity of stochastic programming problems |
127
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
147
click to vote
AGP
1999
IEEE
15 years 7 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
138
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
124
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
105
click to vote
SBACPAD
2005
IEEE
15 years 8 months ago
2005
IEEE
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...