4432 search results - page 58 / 887 » Solving Demodulation as an Optimization Problem |
179
click to vote
MCS
2008
Springer
15 years 6 months ago
2008
Springer
We investigate optimal control problems subject to mixed control-state constraints. The necessary conditions are stated in terms of a local minimum principle. By use of the Fischer...
171
click to vote
ICTAI
2009
IEEE
15 years 3 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...
149
click to vote
ICCS
2007
Springer
16 years 5 days 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...
162
click to vote
AI
2006
Springer
15 years 6 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...
155
click to vote
ICLP
2005
Springer
15 years 11 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...