Sciweavers

2073 search results - page 70 / 415
» Learning for Dynamic Subsumption
Sort
View
105
Voted
AAAI
2007
15 years 4 months ago
Learning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification met...
Horst Samulowitz, Roland Memisevic
105
Voted
WCRE
2007
IEEE
15 years 8 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke
ECIS
2004
15 years 3 months ago
To play, or not to play: building a learning environment through computer simulations
This article analyzes the impact of a computer simulation (business game) on the users' perceived learning. The theoretical model developed in this paper is derived from the ...
Luigi Proserpio, Magni Magni
107
Voted
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 8 months ago
Dynamic Network Selection using Kernels
—We present a new algorithm for vertical handover and dynamic network selection, based on a combination of multiattribute utility theory, kernel learning and stochastic gradient ...
Eric van den Berg, Praveen Gopalakrishnan, Byungsu...
111
Voted
JAIR
2000
94views more  JAIR 2000»
15 years 2 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati