Sciweavers

231 search results - page 35 / 47
» Sensitivity of trust-region algorithms to their parameters
Sort
View
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 6 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 7 days ago
Promising infeasibility and multiple offspring incorporated to differential evolution for constrained optimization
In this paper, we incorporate a diversity mechanism to the differential evolution algorithm to solve constrained optimization problems without using a penalty function. The aim is...
Efrén Mezura-Montes, Jesús Vel&aacut...
SIGCOMM
1998
ACM
13 years 11 months ago
Quality of Service Based Routing: A Performance Perspective
Recent studies provide evidence that Quality ofService QoS routing can provide increased network utilization compared to routing that is not sensitive to QoS requirements of tra...
George Apostolopoulos, Roch Guérin, Sanjay ...
CP
2005
Springer
14 years 8 days ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
PAMI
2008
161views more  PAMI 2008»
13 years 6 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...