2374 search results - page 299 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
119
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
182
Voted
SCALESPACE
2007
Springer
15 years 8 months ago
2007
Springer
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piece...
108
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: The recent advancement of microarray technology with lower noise and better affordability makes it possible to determine expression of several thousand genes simultane...
131
Voted
DAC
1999
ACM
15 years 7 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
125
Voted
PKC
2010
Springer
15 years 6 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...