Sciweavers

339 search results - page 68 / 68
» Can we refactor conditional compilation into aspects
Sort
View
DLOG
2003
13 years 6 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
KI
2006
Springer
13 years 5 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
TON
2010
165views more  TON 2010»
13 years 3 months ago
An analytic throughput model for TCP NewReno
—This paper develops a simple and accurate stochastic model for the steady-state throughput of a TCP NewReno bulk data transfer as a function of round-trip time and loss rate. Ou...
Nadim Parvez, Anirban Mahanti, Carey L. Williamson
SIGCOMM
2005
ACM
13 years 11 months ago
Idle sense: an optimal access method for high throughput and fairness in rate diverse wireless LANs
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practica...
Martin Heusse, Franck Rousseau, Romaric Guillier, ...