1547 search results - page 68 / 310 » Solving Knapsack Problems in a Sticker Based Model |
122
Voted
UAI
1993
15 years 3 months ago
1993
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
118
click to vote
JUCS
2008
15 years 2 months ago
2008
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
221
click to vote
CVIU
1999
15 years 2 months ago
1999
An important problem in computer vision is to determine how features extracted from images are connected to an existing model. In this paper, we focus on solving the registration ...
109
click to vote
ICDCS
1998
IEEE
15 years 6 months ago
1998
IEEE
Market mechanisms solve distributed scheduling problems by allocating the scheduled resources according to market prices. We model distributed scheduling as a discrete resource al...
143
click to vote
IJHIS
2006
15 years 2 months ago
2006
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary ...