430 search results - page 31 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
CPAIOR
2008
Springer
15 years 8 days ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
98
Voted
DMIN
2006
14 years 12 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
ISPD
2006
ACM
15 years 4 months ago
2006
ACM
Advanced process technologies call for a proactive consideration of process variations in design to ensure high parametric timing yield. Despite of its popular use in almost any h...
ICML
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
PKDD
2001
Springer
15 years 2 months ago
2001
Springer
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...