35 search results - page 3 / 7 » How important is a transfer function in discrete heuristic a... |
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
In the paper we present a model based method for generating 3D face models from multiple images by means of an energy minimization algorithm. The energy function takes into accoun...
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
WWW
2010
ACM
14 years 22 days ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
AIPS
2003
13 years 7 months ago
2003
We examine the issues that arise in extending an estimatedregression (ER) planner to reason about autonomous processes that run and have continuous and discrete effects without th...
CONSTRAINTS
2010
13 years 5 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...