4744 search results - page 795 / 949 » Connected Computing |
259
click to vote
AIPS
2011
14 years 10 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
199
click to vote
CAV
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
169
click to vote
DMGT
2011
14 years 10 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
310
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
Software projects often fail because stakeholder communication and involvement are inadequate. This paper proposes a novel method to understand project social networks and their c...
211
click to vote
IAJIT
2011
14 years 10 months ago
2011
: The core of a parallel processing system is the interconnection network by which the system’s processors are linked. Due to the great role played by the interconnection network...