Sciweavers

20441 search results - page 3933 / 4089
» Locally Computable Structures
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 7 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
GG
2004
Springer
15 years 7 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer
142
Voted
ICS
2004
Tsinghua U.
15 years 7 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki
IFIP
2004
Springer
15 years 7 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
IWAN
2004
Springer
15 years 7 months ago
GateScript: A Scripting Language for Generic Active Gateways
In this paper, we present GateScript, a scripting language for active applications to be executed on generic active gateways. Unlike other active networking platforms, it offers a...
Hoa-Binh Nguyen, Andrzej Duda
« Prev « First page 3933 / 4089 Last » Next »