1055 search results - page 60 / 211 » Enumerations in computable structure theory |
POPL
2010
ACM
15 years 4 months ago
2010
ACM
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
AVI
1998
14 years 11 months ago
1998
Information Foraging (IF) Theory addresses user strategies and technology for seeking, gathering, and using on-line information. We present IF-based models and evaluations of two ...