13376 search results - page 296 / 2676 » Problem Solving with |
147
click to vote
CCE
2011
14 years 7 months ago
2011
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
155
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
138
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
148
click to vote
SAC
2000
ACM
15 years 7 months ago
2000
ACM
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
131
click to vote
NIPS
2003
15 years 5 months ago
2003
Optimal solutions to Markov Decision Problems (MDPs) are very sensitive with respect to the state transition probabilities. In many practical problems, the estimation of those pro...