729 search results - page 141 / 146 » Solving subgraph isomorphism problems with constraint progra... |
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
CIAC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
92
Voted
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
100
click to vote
CGO
2011
IEEE
14 years 1 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...