Sciweavers

2978 search results - page 199 / 596
» Operations Research
Sort
View
99
Voted
HEURISTICS
2007
76views more  HEURISTICS 2007»
15 years 3 months ago
Metaheuristics can solve sudoku puzzles
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
Rhyd Lewis
136
Voted
ARTMED
2000
105views more  ARTMED 2000»
15 years 3 months ago
Planning treatment of ischemic heart disease with partially observable Markov decision processes
Diagnosis of a disease and its treatment are not separate, one-shot activities. Instead, they are very often dependent and interleaved over time. This is mostly due to uncertainty...
Milos Hauskrecht, Hamish S. F. Fraser
109
Voted
IOR
2010
86views more  IOR 2010»
15 years 2 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo
123
Voted
SADM
2010
194views more  SADM 2010»
15 years 2 months ago
Seriation and matrix reordering methods: An historical overview
: Seriation is an exploratory combinatorial data analysis technique to reorder objects into a sequence along a one-dimensional continuum so that it best reveals regularity and patt...
Innar Liiv
117
Voted
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 2 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...