86 search results - page 8 / 18 » A Classical Realizability Model for a Semantical Value Restr... |
108
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
GEOINFORMATICA
1998
14 years 9 months ago
1998
The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographi...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
107
click to vote
PE
2010
Springer
14 years 4 months ago
2010
Springer
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...