Sciweavers

920 search results - page 87 / 184
» Generating Satisfiable Problem Instances
Sort
View
DDECS
2009
IEEE
128views Hardware» more  DDECS 2009»
15 years 9 months ago
A fast untestability proof for SAT-based ATPG
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...
Daniel Tille, Rolf Drechsler
140
Voted
PVLDB
2008
170views more  PVLDB 2008»
15 years 29 days ago
Data exchange with data-metadata translations
Data exchange is the process of converting an instance of one schema into an instance of a different schema according to a given specification. Recent data exchange systems have l...
Mauricio A. Hernández, Paolo Papotti, Wang ...
107
Voted
AUTOMATICA
2005
82views more  AUTOMATICA 2005»
15 years 2 months ago
Hierarchical trajectory refinement for a class of nonlinear systems
Trajectory generation for nonlinear control systems is an important and difficult problem. In this paper, we provide a constructive method for hierarchical trajectory refinement. ...
Paulo Tabuada, George J. Pappas
ANTSW
2004
Springer
15 years 8 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
134
Voted
ICAC
2008
IEEE
15 years 9 months ago
Digital Evolution of Behavioral Models for Autonomic Systems
We describe an automated method to generating models of an autonomic system. Specifically, we generate UML state diagrams for a set of interacting objects, including the extensio...
Heather Goldsby, Betty H. C. Cheng, Philip K. McKi...