1402 search results - page 271 / 281 » Sparse-Memory Graph Search |
KBS
2007
14 years 9 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
HPDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
SAC
2010
ACM
14 years 10 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
AIEDAM
2007
14 years 10 months ago
2007
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...