Sciweavers

873 search results - page 55 / 175
» Tournament scoring problem
Sort
View
AIED
2005
Springer
15 years 5 months ago
Effects of Dissuading Unnecessary Help Requests While Providing Proactive Help
We tested effects of dissuading students from requesting help unless they really needed it. The manipulation occurred while the students solved problems on an ITS that provided pro...
R. Charles Murray, Kurt VanLehn
ECAI
2006
Springer
15 years 1 months ago
Calibrating Probability Density Forecasts with Multi-Objective Search
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
Michael Carney, Padraig Cunningham
IANDC
2010
67views more  IANDC 2010»
14 years 10 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
16 years 1 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
ICRA
2007
IEEE
115views Robotics» more  ICRA 2007»
15 years 6 months ago
Sensor Selection Using Information Complexity for Multi-sensor Mobile Robot Localization
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....