Sciweavers

836 search results - page 15 / 168
» On the Complexity of Train Assignment Problems
Sort
View
SAC
2005
ACM
15 years 5 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
NAACL
2010
14 years 9 months ago
Distributed Training Strategies for the Structured Perceptron
Perceptron training is widely applied in the natural language processing community for learning complex structured models. Like all structured prediction learning frameworks, the ...
Ryan T. McDonald, Keith Hall, Gideon Mann
IJHIS
2008
84views more  IJHIS 2008»
14 years 11 months ago
Selective generation of training examples in active meta-learning
Meta-Learning has been successfully applied to acquire knowledge used to support the selection of learning algorithms. Each training example in Meta-Learning (i.e. each meta-exampl...
Ricardo Bastos Cavalcante Prudêncio, Teresa ...
SIGCSE
1998
ACM
131views Education» more  SIGCSE 1998»
15 years 3 months ago
Animation, visualization, and interaction in CS 1 assignments
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
Owen L. Astrachan, Susan H. Rodger
MOBICOM
2006
ACM
15 years 5 months ago
Component based channel assignment in single radio, multi-channel ad hoc networks
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
Ramanuja Vedantham, Sandeep Kakumanu, Sriram Laksh...