Sciweavers

5592 search results - page 387 / 1119
» On Random Betweenness Constraints
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
15 years 6 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
ECOOP
2000
Springer
15 years 11 months ago
Optimizing Java Programs in the Presence of Exceptions
The support for precise exceptions in Java, combined with frequent checks for runtime exceptions, leads to severe limitations on the compiler’s ability to perform program optimiz...
Manish Gupta, Jong-Deok Choi, Michael Hind
AIPS
2010
15 years 7 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
CORR
2007
Springer
60views Education» more  CORR 2007»
15 years 6 months ago
On Minimal Tree Realizations of Linear Codes
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
Navin Kashyap
SAC
2006
ACM
15 years 6 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...