Sciweavers

3009 search results - page 255 / 602
» The Expressive Rate of Constraints
Sort
View
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
16 years 3 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
CPAIOR
2009
Springer
16 years 1 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
POPL
2011
ACM
14 years 9 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
BMCBI
2006
107views more  BMCBI 2006»
15 years 6 months ago
Analysis of optimal phenotypic space using elementary modes as applied to Corynebacterium glutamicum
Background: Quantification of the metabolic network of an organism offers insights into possible ways of developing mutant strain for better productivity of an extracellular metab...
Kalyan Gayen, K. V. Venkatesh
CVPR
2005
IEEE
16 years 8 months ago
Implicit Surfaces Make for Better Silhouettes
This paper advocates an implicit-surface representation of generic 3?D surfaces to take advantage of occluding edges in a very robust way. This lets us exploit silhouette constrai...
Slobodan Ilic, Mathieu Salzmann, Pascal Fua