3475 search results - page 362 / 695 » Backbones in Optimization and Approximation |
175
Voted
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
160
click to vote
INFOCOM
2006
IEEE
16 years 22 days ago
2006
IEEE
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
175
Voted
FCT
2005
Springer
16 years 6 days ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
171
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
166
click to vote
ATAL
2004
Springer
16 years 3 days ago
2004
Springer
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...