920 search results - page 119 / 184 » Generating Satisfiable Problem Instances |
95
Voted
CCS
2006
ACM
15 years 4 months ago
2006
ACM
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
91
Voted
PSB
2003
15 years 2 months ago
2003
This paper is concerned with evaluating the performance of the model and algorithm in [7] for detecting lateral gene transfers events. Using a Poisson process to describe arrival t...
105
Voted
JMLR
2010
14 years 7 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
98
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...