Sciweavers

11740 search results - page 396 / 2348
» More Problems in Rewriting
Sort
View
157
Voted
BMCBI
2008
110views more  BMCBI 2008»
15 years 6 months ago
Assessment of composite motif discovery methods
Background: Computational discovery of regulatory elements is an important area of bioinformatics research and more than a hundred motif discovery methods have been published. Tra...
Kjetil Klepper, Geir Kjetil Sandve, Osman Abul, Jo...
CE
2008
128views more  CE 2008»
15 years 6 months ago
Beyond threaded discussion: Representational guidance in asynchronous collaborative learning environments
Although most online learning environments are predominately text based, researchers have argued that representational support for the conceptual structure of a problem would addr...
Daniel D. Suthers, Ravi K. Vatrapu, Richard Medina...
CORR
2008
Springer
71views Education» more  CORR 2008»
15 years 6 months ago
Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
Sudhir R. Ghorpade, Arunkumar R. Patil, Harish K. ...
CORR
2010
Springer
133views Education» more  CORR 2010»
15 years 6 months ago
Santa Claus Schedules Jobs on Unrelated Machines
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
Ola Svensson
169
Voted
DISOPT
2008
99views more  DISOPT 2008»
15 years 6 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay