952 search results - page 88 / 191 » Computational complexity of stochastic programming problems |
116
click to vote
INFORMATICALT
2007
15 years 16 days ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
137
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
116
click to vote
DAGSTUHL
2003
15 years 2 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
78
Voted
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
LPNMR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...