Sciweavers

2713 search results - page 539 / 543
» Parameterized Tree Systems
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 5 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 5 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
JSA
2008
91views more  JSA 2008»
13 years 5 months ago
Using supplier locality in power-aware interconnects and caches in chip multiprocessors
Conventional snoopy-based chip multiprocessors take an aggressive approach broadcasting snoop requests to all nodes. In addition each node checks all received requests. This appro...
Ehsan Atoofian, Amirali Baniasadi
NECO
2006
111views more  NECO 2006»
13 years 5 months ago
Dynamics and Topographic Organization of Recursive Self-Organizing Maps
Recently, there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, at present, ...
Peter Tiño, Igor Farkas, Jort van Mourik
ASE
2005
137views more  ASE 2005»
13 years 5 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund