1047 search results - page 16 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- In order to increase the transportation capability of elevator group systems in high-rise buildings without adding elevator installation space, double-deck elevator syst...
UAI
1996
13 years 9 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
EOR
2010
13 years 5 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
DMIN
2007
13 years 9 months ago
2007
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
TIT
1998
13 years 7 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...