Sciweavers

4908 search results - page 904 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
PE
2002
Springer
128views Optimization» more  PE 2002»
14 years 11 months ago
Response times in a two-node queueing network with feedback
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server...
Robert D. van der Mei, Bart Gijsen, N. in't Veld, ...
VLDB
2002
ACM
108views Database» more  VLDB 2002»
14 years 11 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten
SAB
2010
Springer
153views Optimization» more  SAB 2010»
14 years 10 months ago
Cooperative Stigmergic Navigation in a Heterogeneous Robotic Swarm
We study self-organized cooperation in a heterogeneous robotic swarm consisting of two sub-swarms. The robots of each sub-swarm play distinct roles based on their different charac...
Frederick Ducatelle, Gianni A. Di Caro, Luca Maria...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 10 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
TKDE
2010
200views more  TKDE 2010»
14 years 10 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...