Sciweavers

9405 search results - page 1440 / 1881
» Computing a Model of Set Theory
Sort
View
JSYML
2007
100views more  JSYML 2007»
15 years 6 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
CORR
2004
Springer
100views Education» more  CORR 2004»
15 years 6 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
JACM
2010
137views more  JACM 2010»
15 years 5 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
WWW
2011
ACM
15 years 1 months ago
Second international workshop on RESTful design (WS-REST 2011)
Over the past few years, the discussion between the two major architectural styles for designing and implementing Web services, the RPC-oriented approach and the resourceoriented ...
Cesare Pautasso, Erik Wilde, Rosa Alarcón
TWC
2010
15 years 1 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
« Prev « First page 1440 / 1881 Last » Next »