10988 search results - page 1703 / 2198 » Algorithmic Folding Complexity |
232
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
200
click to vote
ATMOS
2007
15 years 8 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
195
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
195
Voted
DGO
2007
15 years 8 months ago
2007
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
197
click to vote
DLOG
2004
15 years 8 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...