Sciweavers

949 search results - page 41 / 190
» Programmed Mutagenesis Is Universal
Sort
View
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
15 years 5 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
EOR
2010
160views more  EOR 2010»
15 years 4 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang
IIE
2006
183views more  IIE 2006»
15 years 4 months ago
Desktop Tools for Offline Plagiarism Detection in Computer Programs
Plagiarism in universities has always been a difficult problem to overcome. Various tools have been developed over the past few years to help teachers detect plagiarism in students...
Maxim Mozgovoy
SAS
2000
Springer
15 years 8 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
EDM
2009
132views Data Mining» more  EDM 2009»
15 years 2 months ago
Predicting Students Drop Out: A Case Study
The monitoring and support of university freshmen is considered very important at many educational institutions. In this paper we describe the results of the educational data minin...
Gerben Dekker, Mykola Pechenizkiy, Jan Vleeshouwer...