Sciweavers

1012 search results - page 118 / 203
» Segment intersection searching problems in general settings
Sort
View
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 6 months ago
Interactive evolutionary multi-objective optimization and decision-making using reference direction method
In this paper, we borrow the concept of reference direction approach from the multi-criterion decision-making literature and combine it with an EMO procedure to develop an algorit...
Kalyanmoy Deb, Abhishek Kumar
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
IJCAI
1989
15 years 1 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
CSDA
2007
105views more  CSDA 2007»
14 years 12 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...