Sciweavers

1332 search results - page 34 / 267
» ideas 2008
Sort
View
SIGACT
1998
105views more  SIGACT 1998»
14 years 11 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
SIGKDD
2002
93views more  SIGKDD 2002»
14 years 11 months ago
A Perspective on Inductive Databases
Inductive databases tightly integrate databases with data mining. The key ideas are that data and patterns (or models) are handled in the same way and that an inductive query lang...
Luc De Raedt
AAAI
2008
15 years 2 months ago
Potential-based Shaping in Model-based Reinforcement Learning
Potential-based shaping was designed as a way of introducing background knowledge into model-free reinforcement-learning algorithms. By identifying states that are likely to have ...
John Asmuth, Michael L. Littman, Robert Zinkov
UAI
2003
15 years 1 months ago
An Empirical Study of w-Cutset Sampling for Bayesian Networks
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...
Bozhena Bidyuk, Rina Dechter
TCS
2002
14 years 11 months ago
Associative language descriptions
The new Associative Language Description (ALD) model, a combination of locally testable and constituent structure ideas, is proposed, arguing that in practice it equals context-fr...
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pie...