5138 search results - page 90 / 1028 » Randomized Algorithms for 3-SAT |
119
Voted
CRYPTO
2012
Springer
13 years 4 months ago
2012
Springer
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
111
Voted
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
110
click to vote
APPROX
2000
Springer
15 years 6 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
124
click to vote
ICOIN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...