Sciweavers

10848 search results - page 1819 / 2170
» Programming in Biomolecular Computation
Sort
View
JFP
2008
72views more  JFP 2008»
15 years 6 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
JMLR
2008
168views more  JMLR 2008»
15 years 6 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
IOR
2007
106views more  IOR 2007»
15 years 6 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
BMCBI
2005
94views more  BMCBI 2005»
15 years 6 months ago
T.I.M.S: TaqMan Information Management System, tools to organize data flow in a genotyping laboratory
Background: Single Nucleotide Polymorphism (SNP) genotyping is a major activity in biomedical research. The Taqman technology is one of the most commonly used approaches. It produ...
Stéphanie Monnier, David G. Cox, Tim Albion...
« Prev « First page 1819 / 2170 Last » Next »