4430 search results - page 60 / 886 » Solving Optimization Problems with DLL |
108
click to vote
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
AI
2006
Springer
14 years 12 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
EMNLP
2008
15 years 1 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...