Sciweavers

4208 search results - page 215 / 842
» Better Selection of the Best
Sort
View
JAIR
2008
120views more  JAIR 2008»
15 years 6 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
EXPERT
1998
83views more  EXPERT 1998»
15 years 6 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
TIT
2002
78views more  TIT 2002»
15 years 6 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
NOMS
2010
IEEE
189views Communications» more  NOMS 2010»
15 years 5 months ago
Self-optimization for handover oscillation control in LTE
— In this paper we analyze the performance of a self optimizing algorithm for handover parameter control which adjusts the settings depending on the oscillations experienced betw...
Jose Alonso-Rubio
PAKDD
2009
ACM
96views Data Mining» more  PAKDD 2009»
16 years 1 months ago
Aggregated Subset Mining
The usual data mining setting uses the full amount of data to derive patterns for different purposes. Taking cues from machine learning techniques, we explore ways to divide the d...
Albrecht Zimmermann, Björn Bringmann