1084 search results - page 134 / 217 » Optimal worm-scanning method using vulnerable-host distribut... |
111
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
113
click to vote
GECCO
2008
Springer
15 years 29 days ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
75
Voted
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
The size and complexity of current custom VLSI have forced the use of high-level programming languages to describe hardware, and compiler and synthesis technology bstract designs ...
113
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...