9787 search results - page 695 / 1958 » A Utile Function Optimizer |
204
Voted
AAAI
1996
15 years 8 months ago
1996
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
187
click to vote
CG
2004
Springer
15 years 7 months ago
2004
Springer
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...
215
click to vote
AMC
2006
15 years 7 months ago
2006
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
263
click to vote
STOC
2012
ACM
13 years 10 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
222
click to vote
AIPS
2011
14 years 11 months ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...