Sciweavers

1542 search results - page 202 / 309
» Kernelization of packing problems
Sort
View
FOCS
2005
IEEE
15 years 7 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
ECCC
2000
140views more  ECCC 2000»
15 years 1 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 5 months ago
Controlling overfitting with multi-objective support vector machines
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
Ingo Mierswa
DIMVA
2010
15 years 3 months ago
HookScout: Proactive Binary-Centric Hook Detection
Abstract. In order to obtain and maintain control, kernel malware usually makes persistent control flow modifications (i.e., installing hooks). To avoid detection, malware develope...
Heng Yin, Pongsin Poosankam, Steve Hanna, Dawn Xia...
USENIX
1990
15 years 3 months ago
Efficient User-Level File Cache Management on the Sun Vnode Interface
In developing a distributed file system, there are several good reasons for implementing the client file cache manager as a user-level process. These include ease of implementatio...
David C. Steere, James J. Kistler, Mahadev Satyana...