3406 search results - page 199 / 682 » General Search Algorithms for Energy Minimization Problems |
135
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
156
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
125
click to vote
ITICSE
1997
ACM
15 years 8 months ago
1997
ACM
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
127
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
165
Voted
PPPJ
2003
ACM
15 years 9 months ago
2003
ACM
A Java implementation of a key collision attack on DES suggested by Eli Biham, [1], is discussed. Storage space minimization and fast searching techniques to speed up the attack a...