9325 search results - page 225 / 1865 » The decentralized implementability problem |
110
click to vote
TRANSCI
2011
14 years 10 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
121
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
126
click to vote
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
119
click to vote
AH
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The virtual laboratory (VILAB) supports interactive problem solving in computer science with access to complex software-tools. During the problem solving processes the le...
102
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...