986 search results - page 27 / 198 » Generalized Goal Programming: polynomial methods and applica... |
138
click to vote
LCTRTS
2007
Springer
15 years 10 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
107
click to vote
HM
2007
Springer
15 years 10 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 ...
160
click to vote
JCP
2007
15 years 4 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
137
click to vote
JGO
2010
14 years 11 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
125
click to vote
WSC
1997
15 years 5 months ago
1997
This paper presents an implementation methodology appropriate for providing a broad range of proven, classical Operations Research methods and techniques to the simulation modeler...