Sciweavers

952 search results - page 22 / 191
» Computational complexity of stochastic programming problems
Sort
View
ICFP
2006
ACM
15 years 4 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
COR
2007
133views more  COR 2007»
14 years 4 months ago
Reverse logistics network design with stochastic lead times
This work is concerned with the efficient design of a reverse logistics network using an extended version of models currently found in the literature. Those traditional, basic mo...
Kris Lieckens, Nico Vandaele
IJCAI
2003
14 years 5 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (�...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...
AAAI
1998
14 years 5 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
AIR
2010
96views more  AIR 2010»
14 years 4 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták