Sciweavers

203 search results - page 21 / 41
» Real Arguments Are Approximate Arguments
Sort
View
127
Voted
INFOCOM
2008
IEEE
15 years 8 months ago
Making Large Scale Deployment of RCP Practical for Real Networks
—We recently proposed the Rate Control Protocol (RCP) as a way to minimize download times (or flow-completion times). Simulations suggest that if RCP were widely deployed, downl...
Chia-Hui Tai, Jiang Zhu, Nandita Dukkipati
LPAR
2007
Springer
15 years 8 months ago
Extending a Resolution Prover for Inequalities on Elementary Functions
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
Behzad Akbarpour, Lawrence C. Paulson
95
Voted
CIE
2005
Springer
15 years 7 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
141
Voted
RE
2001
Springer
15 years 6 months ago
Goal-Oriented Requirements Engineering: A Guided Tour
pture, at different levels of abstraction, the various objectives the system under consideration should achieve. Goal-oriented requirements engineering is concerned with the use o...
Axel van Lamsweerde
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 6 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...