Sciweavers

4266 search results - page 714 / 854
» The container loading problem
Sort
View
TEC
2002
183views more  TEC 2002»
13 years 7 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
TSMC
2002
107views more  TSMC 2002»
13 years 7 months ago
Guaranteed robust nonlinear estimation with application to robot localization
When reliable prior bounds on the acceptable errors between the data and corresponding model outputs are available, bounded-error estimation techniques make it possible to characte...
Luc Jaulin, Michel Kieffer, Eric Walter, Dominique...
NAR
2007
81views more  NAR 2007»
13 years 7 months ago
Pseudogene.org: a comprehensive database and comparison platform for pseudogene annotation
The Pseudogene.org database serves as a comprehensive repository for pseudogene sequence annotation. The definition of a pseudogene varies within the literature, resulting in sign...
John E. Karro, Yangpan Yan, Deyou Zheng, Zhaolei Z...
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase