Sciweavers

8647 search results - page 533 / 1730
» The Container Selection Problem
Sort
View
EMNLP
2007
15 years 8 months ago
What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA
This paper presents a syntax-driven approach to question answering, specifically the answer-sentence selection problem for short-answer questions. Rather than using syntactic fea...
Mengqiu Wang, Noah A. Smith, Teruko Mitamura
NIPS
2008
15 years 8 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
ACL
2006
15 years 8 months ago
Semantic Parsing with Structured SVM Ensemble Classification Models
We present a learning framework for structured support vector models in which boosting and bagging methods are used to construct ensemble models. We also propose a selection metho...
Minh Le Nguyen, Akira Shimazu, Xuan Hieu Phan
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 7 months ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
DAM
2006
89views more  DAM 2006»
15 years 7 months ago
First vs. best improvement: An empirical study
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
Pierre Hansen, Nenad Mladenovic