Sciweavers

151 search results - page 10 / 31
» Handling Boolean A Boxes
Sort
View
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
13 years 7 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
ICMLA
2009
13 years 5 months ago
Discovering Characterization Rules from Rankings
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
Ansaf Salleb-Aouissi, Bert C. Huang, David L. Walt...
SAC
2005
ACM
14 years 1 months ago
The container loading problem
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
Andrew Lim, Xingwen Zhang
HICSS
1998
IEEE
112views Biometrics» more  HICSS 1998»
13 years 11 months ago
AESOP: An Outline-Oriented Authoring System
Because a hypermedia document is more complex than conventional text, it requires preparation with respect to two key aspects. First, the author begins to develop a "vision&q...
Takeshi Shimizu, Stephen W. Smoliar, John S. Borec...
ISMIS
1994
Springer
13 years 11 months ago
BDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
Jean Goubault, Joachim Posegga