Sciweavers

197 search results - page 22 / 40
» Complexity of Max-SAT using stochastic algorithms
Sort
View
IJCNN
2006
IEEE
15 years 8 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
CORR
2010
Springer
87views Education» more  CORR 2010»
15 years 14 days ago
Using Evolution Strategy with Meta-models for Well Placement Optimization
Optimum implementation of non-conventional wells allows us to increase considerably hydrocarbon recovery. By considering the high drilling cost and the potential improvement in we...
Zyed Bouzarkouna, Didier Yu Ding, Anne Auger
144
Voted
JSAC
2011
100views more  JSAC 2011»
14 years 4 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
103
Voted
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 8 months ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
FOGA
1998
15 years 3 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal