Sciweavers

1084 search results - page 31 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
ICCAD
2009
IEEE
152views Hardware» more  ICCAD 2009»
13 years 5 months ago
Adaptive sampling for efficient failure probability analysis of SRAM cells
In this paper, an adaptive sampling method is proposed for the statistical SRAM cell analysis. The method is composed of two components. One part is the adaptive sampler that manip...
Javid Jaffari, Mohab Anis
ECAI
2000
Springer
14 years 1 days ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Using a distance metric to guide PSO algorithms for many-objective optimization
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Upali K. Wickramasinghe, Xiaodong Li
ICPP
2000
IEEE
14 years 2 days ago
Evaluation of Loop Grouping Methods Based on Orthogonal Projection Spaces
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space Jn onto a k-dimensional one, called the projected sp...
Ioannis Drositis, Georgios I. Goumas, Nectarios Ko...
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 1 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf