Sciweavers

10493 search results - page 164 / 2099
» Dynamic Word Problems
Sort
View
MICAI
2005
Springer
14 years 1 months ago
A Comparison of Memetic Recombination Operators for the MinLA Problem
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ITS
2010
Springer
145views Multimedia» more  ITS 2010»
14 years 28 days ago
Eliciting Informative Feedback in Peer Review: Importance of Problem-Specific Scaffolding
In a controlled experiment using Comrade, a computer-supported peer review system, student reviewers offered feedback to student authors on their written analyses of a problem scen...
Ilya M. Goldin, Kevin D. Ashley
TREC
2001
13 years 9 months ago
The Bias Problem and Language Models in Adaptive Filtering
We used the YFILTER filtering system for experiments on updating profiles and setting thresholds. We developed a new method of using language models for updating profiles that is ...
Yi Zhang 0001, James P. Callan
COR
2008
118views more  COR 2008»
13 years 8 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
MP
2006
100views more  MP 2006»
13 years 8 months ago
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, ...