Sciweavers

2477 search results - page 373 / 496
» Approximate extended formulations
Sort
View
ICSE
2010
IEEE-ACM
15 years 6 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
AAAI
2006
15 years 5 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
FLAIRS
2003
15 years 5 months ago
Topic Extraction and Extension to Support Concept Mapping
Successful knowledge management may depend not only on knowledge capture, but on knowledge construction—on formulating new and useful knowledge that was not previously available...
David B. Leake, Ana Gabriela Maguitman, Thomas Rei...
BMCBI
2008
105views more  BMCBI 2008»
15 years 4 months ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 4 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu