5159 search results - page 467 / 1032 » Structural Testing of Executables |
195
click to vote
ISAAC
1995
Springer
15 years 11 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...
184
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 ...
181
click to vote
NIPS
2008
15 years 9 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
193
click to vote
DELOS
2001
15 years 9 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...
192
click to vote
ACL
1998
15 years 9 months ago
1998
This paper presents a system which automatically generates shallow semantic frame structures for conversational speech in unrestricted domains. We argue that such shallow semantic...