Sciweavers

269 search results - page 42 / 54
» A branch and bound method for stochastic global optimization
Sort
View
ISCI
2007
141views more  ISCI 2007»
14 years 9 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
SIGIR
2010
ACM
14 years 9 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
BMCBI
2006
194views more  BMCBI 2006»
14 years 9 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
ICIP
2003
IEEE
15 years 11 months ago
Unsupervised statistical sketching for non-photorealistic rendering models
This paper investigates the use of the Bayesian inference for devising an unsupervised sketch rendering procedure. As likelihood model of this inference, we exploit the recent sta...
Max Mignotte