Sciweavers

898 search results - page 38 / 180
» A Linear Tabling Mechanism
Sort
View
AAAI
2010
13 years 9 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
SPAA
2009
ACM
14 years 8 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
ICDE
2010
IEEE
439views Database» more  ICDE 2010»
14 years 4 months ago
Nb-GCLOCK: A Non-blocking Buffer Management Based on the Generalized CLOCK
— In this paper, we propose a non-blocking buffer management scheme based on a lock-free variant of the GCLOCK page replacement algorithm. Concurrent access to the buffer managem...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hayato ...
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
13 years 7 months ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....
ICC
2007
IEEE
105views Communications» more  ICC 2007»
14 years 2 months ago
Wheel of Trust: A Secure Framework for Overlay-Based Services
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...
Guor-Huar Lu, Zhi-Li Zhang