Sciweavers

1650 search results - page 191 / 330
» How to Turn the Page
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
14 years 10 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
JSAC
2006
120views more  JSAC 2006»
14 years 10 months ago
A Tutorial on Cross-Layer Optimization in Wireless Networks
This tutorial paper overviews recent developments in optimization-based approaches for resource allocation problems in wireless systems. We begin by overviewing important results i...
Xiaojun Lin, Ness B. Shroff, R. Srikant
IJES
2007
71views more  IJES 2007»
14 years 10 months ago
Power management in external memory using PA-CDRAM
Abstract: Main memory has become one of the largest contributors to overall energy consumption and offers many opportunities for power/energy reduction. In this paper, we propose ...
Nevine AbouGhazaleh, Bruce R. Childers, Daniel Mos...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
14 years 10 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
SLOGICA
2008
116views more  SLOGICA 2008»
14 years 10 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska