Sciweavers

4488 search results - page 282 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
SYNASC
2005
IEEE
110views Algorithms» more  SYNASC 2005»
15 years 10 months ago
Performance Tuning of Evolutionary Algorithms Using Particle Sub Swarms
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
Crina Grosan, Ajith Abraham, Monica Nicoara
EOR
2010
140views more  EOR 2010»
15 years 2 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
CORR
2012
Springer
185views Education» more  CORR 2012»
14 years 10 days ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 4 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
16 years 6 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu