Sciweavers

175 search results - page 11 / 35
» Partially Ordered Runs: A Case Study
Sort
View
AAAI
2006
13 years 8 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
IPPS
2007
IEEE
14 years 1 months ago
Formal Analysis for Debugging and Performance Optimization of MPI
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
Ganesh Gopalakrishnan, Robert M. Kirby
CSB
2005
IEEE
152views Bioinformatics» more  CSB 2005»
14 years 29 days ago
Consensus Genetic Maps: A Graph Theoretic Approach
A genetic map is an ordering of genetic markers constructed from genetic linkage data for use in linkage studies and experimental design. While traditional methods have focused on...
Benjamin G. Jackson, Srinivas Aluru, Patrick S. Sc...
CSFW
2000
IEEE
13 years 11 months ago
Information Flow Analysis in a Discrete-Time Process Algebra
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
Riccardo Focardi, Roberto Gorrieri, Fabio Martinel...
BMCBI
2011
13 years 2 months ago
PileLine: a toolbox to handle genome position information in next-generation sequencing studies
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
Daniel Glez-Peña, Gonzalo Gómez-L&oa...