Sciweavers

11539 search results - page 2257 / 2308
» On Learning from Exercises
Sort
View
CIKM
2009
Springer
15 years 2 months ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
15 years 2 months ago
Grouped graphical Granger modeling methods for temporal causal modeling
We develop and evaluate an approach to causal modeling based on time series data, collectively referred to as“grouped graphical Granger modeling methods.” Graphical Granger mo...
Aurelie C. Lozano, Naoki Abe, Yan Liu, Saharon Ros...
OOPSLA
2009
Springer
15 years 2 months ago
Good examples for exposing bad practice: a "killer examples" workshop
The “Killer Examples” series of workshops are highly interactive workshops which have been an annual occurrence at OOPSLA since 2002. The goals of the workshop are to bring to...
Dale Skrien, Michael E. Caspersen, Jürgen B&o...
AGENTS
2001
Springer
15 years 2 months ago
Adjustable autonomy in real-world multi-agent environments
Through adjustable autonomy (AA), an agent can dynamically vary the degree to which it acts autonomously, allowing it to exploit human abilities to improve its performance, but wi...
Paul Scerri, David V. Pynadath, Milind Tambe
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
« Prev « First page 2257 / 2308 Last » Next »