3663 search results - page 137 / 733 » Problems in the ontology of computer programs |
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
HM
2007
Springer
15 years 4 months ago
2007
Springer
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
ORL
2008
14 years 10 months ago
2008
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...