Sciweavers

1589 search results - page 3 / 318
» Constraints with Variables' Annotations
Sort
View
ECMDAFA
2008
Springer
74views Hardware» more  ECMDAFA 2008»
13 years 9 months ago
Annotation Framework Validation Using Domain Models
Frameworks and libraries that use annotations are becoming popular. However, there is not enough software engineering support for annotation development. In particular, the validat...
Carlos Noguera, Laurence Duchien
RECOMB
2003
Springer
14 years 7 months ago
Physical network models and multi-source data integration
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
Chen-Hsiang Yeang, Tommi Jaakkola
MICAI
2004
Springer
14 years 24 days ago
A Preprocessing That Combines Heuristic and Surrogate Constraint Analysis to Fix Variables in TSP
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
María Auxilio Osorio Lama, David Pinto
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
PEPM
1993
ACM
13 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen