Sciweavers

526 search results - page 9 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 19 days ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck
DAGSTUHL
1996
13 years 10 months ago
On-line Algorithms in Machine Learning
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
Avrim Blum
AAAI
2006
13 years 10 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
14 years 20 days ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...