#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- M. Locatelli
- J. Global Optimization
- 1997

- Matteo Locatelli, Roberto Gatti, Marco Tettamanti
- Front. Psychology
- 2012

Conceptual knowledge accessed by language may involve the reactivation of the associated primary sensory-motor processes. Whether these embodied representations are indeed constitutive to conceptual knowledge is hotly debated, particularly since direct evidence that sensory-motor expertise can improve conceptual processing is scarce. In this study, we… (More)

- M. Locatelli
- J. Global Optimization
- 2000

- M. Locatelli, F. Schoen
- 2003

We recently discovered 5 new putative globally optimum configurations for Morse clusters at ρ = 8. This report contains some algorithmic details as well as the structures determined with our method. Methodology After the success obtained in solving minimum energy conformation problems for Lennard-Jones clusters (see [LS02] and [LS03]) we recently adapted… (More)

- M Locatelli
- 2000

1. INTRODUCTION In this paper we consider Simulated Annealing algorithms (SA in what follows) applied to continuous global optimization problems, i.e. problems with the following form f = min x2X f(x); (1.1) where X < n is a continuous domain, often assumed to be compact, which, combined with the continuity or lower semicontinuity of f, guarantees the… (More)

In this paper we propose convex and LP bounds for Standard Quadratic Programming (StQP) problems and employ them within a branch-and-bound approach. We first compare different bounding strategies for StQPs in terms both of the quality of the bound and of the computation times. It turns out that the polyhedral bounding strategy is the best one to be used… (More)

In this paper we introduce a graph problem, called Maximum Node Clustering (MNC). We prove that the problem is strongly NP -complete and show that it can be approximated in polynomial time within a ratio arbitrarily close to 2. For the special case where the graph is a tree, we prove that the problem is weakly NP -complete as it generalizes the 0/1 Knapsack… (More)

- A. R. M. Jalal Uddin Jamali, A. Grosso, M. Locatelli, F. Schoen
- 2009 12th International Conference on Computers…
- 2009

Packing problems have mathematical as well as practical application point of interest. We present, here, Monotonic Basin Hopping heuristic approach to solve the problem of packing identical circles within a minimum size of circular container. Extensive computational experiments have been performed for analyzing the problem as well as for choosing an… (More)

- M. Locatelli, F. Schoen
- 2003

We recently discovered 5 new putative globally optimum configurations for Morse clusters at ρ = 8. This report contains some algorithmic details as well as the structures determined with our method. Methodology After the success obtained in solving minimum energy conformation problems for Lennard-Jones clusters (see [LS02] and [LS03]) we recently adapted… (More)

- ‹
- 1
- ›