Sciweavers

1176 search results - page 73 / 236
» Implicit Abstraction Heuristics
Sort
View
ECML
2006
Springer
14 years 1 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
EDM
2008
117views Data Mining» more  EDM 2008»
13 years 11 months ago
Integrating Knowledge Gained From Data Mining With Pedagogical Knowledge
Abstract. Discovering knowledge from raw data is one of the goals of data mining. Yet, it is not always clear how this knowledge is used in educational computing systems and how ex...
Roland Hübscher, Sadhana Puntambekar
ATMOS
2009
105views Optimization» more  ATMOS 2009»
13 years 11 months ago
On Assessing Robustness in Transportation Planning
Abstract. We consider a fundamental problem, called QoS-aware Multicommodity Flow, for assessing robustness in transportation planning. It constitutes a natural generalization of t...
Apostolos Bessas, Christos D. Zaroliagis
CSDA
2007
109views more  CSDA 2007»
13 years 10 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
PPSN
2010
Springer
13 years 8 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl