674 search results - page 71 / 135 » Subwebs for specialized search |
AAECC
1995
Springer
14 years 1 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
ICPR
2010
IEEE
14 years 25 days ago
2010
IEEE
Appropriate feature selection is a very crucial issue in any machine learning framework, specially in Maximum Entropy (ME). In this paper, the selection of appropriate features for...
AAAI
2008
14 years 18 hour ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
WSC
2007
14 years 15 hour ago
2007
The problem of path planning for Unmanned Aerial Vehicles (UAV) with a tracking mission, when some a priori information about the targets and the environment is available can in s...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...