Sciweavers

1964 search results - page 116 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
CSE
2009
IEEE
13 years 5 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
14 years 2 months ago
A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio
One of the most critical issues that remains to be fully addressed in existing multimodal evolutionary algorithms is the difficulty in pre-specifying parameters used for estimatin...
Xiaodong Li
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolutionary computation methods for synchronization of effects based operations
Effects based operations (EBO) is a concept based on the premise that a desired strategic outcome can be achieved through synergistic, multiplicative, and cumulative application ...
Jeffrey P. Ridder
BIRTHDAY
2011
Springer
12 years 8 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
JAR
2000
123views more  JAR 2000»
13 years 7 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle