Sciweavers

727 search results - page 84 / 146
» Private approximation of search problems
Sort
View
WAOA
2004
Springer
85views Algorithms» more  WAOA 2004»
14 years 3 months ago
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
Leah Epstein, Asaf Levin
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 10 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 4 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
TEC
2010
77views more  TEC 2010»
13 years 4 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader

Lecture Notes
443views
15 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount