952 search results - page 120 / 191 » Computational complexity of stochastic programming problems |
119
click to vote
RTS
2000
15 years 2 months ago
2000
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
156
click to vote
CONCUR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
124
click to vote
DEDUCTIVE
1994
15 years 4 months ago
1994
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
108
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We consider several private database query problems. The starting point of this work is the element rank problem: the server holds a database of n integers, and the user an integer...
115
click to vote
WG
2007
Springer
15 years 9 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...