5158 search results - page 943 / 1032 » Generalization of the Dempster-Shafer Theory |
183
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
172
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
181
click to vote
EMSOFT
2005
Springer
15 years 12 months ago
2005
Springer
The central idea behind interface-based design is to describe components by a component interface. In contrast to a component description that describes what a component does, a c...
153
click to vote
EUROCAST
2005
Springer
15 years 12 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
167
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...