7991 search results - page 398 / 1599 » Using More Reasoning to Improve |
158
click to vote
ALP
1994
Springer
15 years 11 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
166
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
187
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
Security and privacy issues for Location-Based Services (LBS) and geolocation-capable applications often revolve around designing a User Interface (UI) such that users are informe...
151
click to vote
ICCSA
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. In this paper, we consider a two-layer hierarchy, ı.e. micro and umbrella layer, cellular system, and propose a new hand-off mechanism to minimize call blocking probabil...
276
click to vote
WIOPT
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...