952 search results - page 100 / 191 » Computational complexity of stochastic programming problems |
142
Voted
HPCN
1998
Springer
15 years 7 months ago
1998
Springer
We describe the Paraflow system for connecting heterogeneous computing services together into a flexible and efficient data-mining metacomputer. There are three levels of parallel...
110
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
125
click to vote
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
107
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
114
click to vote
ISCAS
1994
IEEE
15 years 7 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...