Sciweavers

417 search results - page 31 / 84
» Orderings for Innermost Termination
Sort
View
CALCO
2009
Springer
166views Mathematics» more  CALCO 2009»
14 years 2 months ago
Distributive Lattice-Structured Ontologies
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
Hans Bruun, Dion Coumans, Mai Gehrke
WOWMOM
2005
ACM
112views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
Revisit of RTS/CTS Exchange in High-Speed IEEE 802.11 Networks
IEEE 802.11 Medium Access Control (MAC) called Distributed Coordination Function (DCF) provides two different access modes, namely, 2-way (basic access) and 4-way (RTS/CTS) hands...
Ilenia Tinnirello, Sunghyun Choi, Youngsoo Kim
CSL
2004
Springer
13 years 11 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
13 years 7 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CF
2005
ACM
13 years 9 months ago
Dynamic loop pipelining in data-driven architectures
Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over micro...
João M. P. Cardoso