12194 search results - page 165 / 2439 » cans 2010 |
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...
132
click to vote
IJHPCA
2006
15 years 4 months ago
2006
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...
143
Voted
COLOGNETWENTE
2010
15 years 2 months ago
2010
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...
155
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
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...