Sciweavers

6894 search results - page 1108 / 1379
» Generation Problems
Sort
View
CAISE
2004
Springer
15 years 10 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
CAV
2004
Springer
126views Hardware» more  CAV 2004»
15 years 10 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
ATVA
2006
Springer
191views Hardware» more  ATVA 2006»
15 years 10 months ago
Automatic Verification of Hybrid Systems with Large Discrete State Space
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang,...
CP
2004
Springer
15 years 10 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...
« Prev « First page 1108 / 1379 Last » Next »