Sciweavers

131 search results - page 21 / 27
» Solution Enumeration for Projected Boolean Search Problems
Sort
View
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
13 years 4 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
MMM
2010
Springer
141views Multimedia» more  MMM 2010»
13 years 8 months ago
Slow Intelligence Systems
: Networks and distributed computing systems are becoming increasingly important and at the same time, more and more critical to the world of Information Technology. This rash spre...
Shi-Kuo Chang
IPPS
2005
IEEE
14 years 10 days ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
OOPSLA
2010
Springer
13 years 5 months ago
Scalable and systematic detection of buggy inconsistencies in source code
Software developers often duplicate source code to replicate functionality. This practice can hinder the maintenance of a software project: bugs may arise when two identical code ...
Mark Gabel, Junfeng Yang, Yuan Yu, Moisés G...
SIGIR
2011
ACM
12 years 9 months ago
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity
This work explores the problem of cross-lingual pairwise similarity, where the task is to extract similar pairs of documents across two different languages. Solutions to this pro...
Ferhan Ture, Tamer Elsayed, Jimmy J. Lin