845 search results - page 78 / 169 » Connecting Many-Sorted Theories |
169
click to vote
PE
2002
Springer
15 years 5 months ago
2002
Springer
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
176
click to vote
MST
2010
15 years 4 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
144
click to vote
SYNTHESE
2011
15 years 1 months ago
2011
: Both realists and instrumentalists have found it difficult to understand (much less accept) Carnap’s developed view on theoretical terms, which attempts to stake out a neutral ...
222
click to vote
TIT
2010
15 years 26 days ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
207
click to vote
AOSD
2012
ACM
14 years 1 months ago
2012
ACM
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...