Sciweavers

1193 search results - page 27 / 239
» A primer of simple theories
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
CADE
2008
Springer
16 years 3 days ago
THF0 - The Core of the TPTP Language for Higher-Order Logic
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
Christoph Benzmüller, Florian Rabe, Geoff Sut...
INFOCOM
1997
IEEE
15 years 4 months ago
A Linear Control Approach to Explicit Rate Feedback in ATM Networks
Rate-based feedback congestion control has been proposed as a form of traffic management for available bit rate traffic in ATM networks. This paper discusses applying linear con...
Charles E. Rohrs, Randall A. Berry
BIRTHDAY
2010
Springer
15 years 16 hour ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller
ICAIL
2003
ACM
15 years 5 months ago
Developing Legal Knowledge Based Systems Through Theory Construction
Bench-Capon and Sartor have proposed that reasoning with legal cases be seen as a process of theory construction, evaluation and application. They have proposed a set of theory co...
Alison Chorley, Trevor J. M. Bench-Capon