454 search results - page 75 / 91 » On improving approximate solutions by evolutionary algorithm... |
113
click to vote
HM
2009
Springer
15 years 6 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
113
click to vote
ICDCN
2009
Springer
15 years 6 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
111
click to vote
ANTSW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
116
click to vote
AAAI
1997
15 years 2 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
132
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...