6014 search results - page 554 / 1203 » Structural Testing with Use Cases |
245
click to vote
TAINN
2005
Springer
16 years 20 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
235
click to vote
EURODAC
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper presents a testability improvement method for digital systems described in VHDL behavioral specification. The method is based on testability analysis at registertransfe...
190
click to vote
ISAAC
1995
Springer
15 years 10 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
176
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
184
click to vote
DELOS
2001
15 years 8 months ago
2001
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...