Sciweavers

12194 search results - page 165 / 2439
» cans 2010
Sort
View
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 26 days ago
Simulations of Weighted Tree Automata
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called f...
Zoltán Ésik, Andreas Maletti
82
Voted
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 26 days ago
A Theory of Network Equivalence
We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can...
Ralf Koetter, Michelle Effros, Muriel Médar...
106
Voted
IJHPCA
2006
160views more  IJHPCA 2006»
15 years 23 days ago
High Performance Remote Memory Access Communication: The Armci Approach
pc.sagepub.com/cgi/content/abstract/20/2/233 The online version of this article can be found at: Published by: http://www.sagepublications.com can be found at:International Journal...
Jarek Nieplocha, Vinod Tipparaju, Manojkumar Krish...
109
Voted
COLOGNETWENTE
2010
14 years 11 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
117
Voted
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 11 months ago
Reformulation of Global Constraints in Answer Set Programming
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
Christian Drescher, Toby Walsh