Sciweavers

1631 search results - page 302 / 327
» Extreme Programming - Back to Basics
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
13 years 8 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
RV
2010
Springer
177views Hardware» more  RV 2010»
13 years 8 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
BMCBI
2011
13 years 1 months ago
LAVA: An Open-Source Approach To Designing LAMP (Loop-Mediated Isothermal Amplification) DNA Signatures
Background: We developed an extendable open-source Loop-mediated isothermal AMPlification (LAMP) signature design program called LAVA (LAMP Assay Versatile Analysis). LAVA was cre...
Clinton Torres, Elizabeth A. Vitalis, Brian R. Bak...
EDBT
2011
ACM
256views Database» more  EDBT 2011»
13 years 1 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICALP
2011
Springer
13 years 1 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...