Sciweavers

632 search results - page 81 / 127
» Combining programming with theorem proving
Sort
View
BMCBI
2008
172views more  BMCBI 2008»
13 years 8 months ago
Classification of drug molecules considering their IC50 values using mixed-integer linear programming based hyper-boxes method
Background: A priori analysis of the activity of drugs on the target protein by computational approaches can be useful in narrowing down drug candidates for further experimental t...
Pelin Armutlu, Muhittin Emre Ozdemir, Fadime Ü...
TCS
2002
13 years 7 months ago
Strictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness ...
Mario Coppo, Ferruccio Damiani, Paola Giannini
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
SIAMCOMP
2000
88views more  SIAMCOMP 2000»
13 years 7 months ago
Gadgets, Approximation, and Linear Programming
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
ENTCS
2010
130views more  ENTCS 2010»
13 years 8 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...