1139 search results - page 15 / 228 » Bounded Ideation Theory |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we p...
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
RECOMB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definitio...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Many distribution algorithms have been proposed up to now for P2P real time streaming. However, due to the lack of basic theoretical results and bounds, common sense and intuiti...