Sciweavers

510 search results - page 11 / 102
» How Should We Solve Search Problems Privately
Sort
View
SRDS
2006
IEEE
14 years 1 months ago
How To Safeguard Your Sensitive Data
In order to safeguard a sensitive database, we must ensure both its privacy and its longevity. However, privacy and longevity tend to be competing objectives. We show how to desig...
Bob Mungamuru, Hector Garcia-Molina, Subhasish Mit...
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
13 years 7 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
ICDE
2010
IEEE
217views Database» more  ICDE 2010»
14 years 2 months ago
Toward industrial-strength keyword search systems over relational data
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
Akanksha Baid, Ian Rae, AnHai Doan, Jeffrey F. Nau...
CP
2005
Springer
14 years 1 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
ATAL
2009
Springer
14 years 2 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli