Sciweavers

3333 search results - page 332 / 667
» Optimal Power-Down Strategies
Sort
View
IUI
2004
ACM
16 years 5 days ago
Designing example-critiquing interaction
In many practical scenarios, users are faced with the problem of choosing the most preferred outcome from a large set of possibilities. As people are unable to sift through them m...
Boi Faltings, Pearl Pu, Marc Torrens, Paolo Viappi...
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 11 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...
CISS
2007
IEEE
15 years 10 months ago
How Many Users should be Turned On in a Multi-Antenna Broadcast Channel
This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where each user has perfect channel knowledge and the base station obtains c...
Wei Dai, Youjian Liu, Brian Rider
ICLP
2007
Springer
15 years 10 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
ATAL
2006
Springer
15 years 10 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin