Sciweavers

478 search results - page 28 / 96
» Local Search for Computing Normal Circumstances Models
Sort
View
RECOMB
2004
Springer
14 years 10 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
WWW
2004
ACM
14 years 11 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Lattice model refinement of protein structures
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
Martin Mann, Alessandro Dal Palù
IROS
2007
IEEE
189views Robotics» more  IROS 2007»
14 years 4 months ago
Differential evolution approach to the grid-based localization and mapping problem
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
Luis Moreno, Santiago Garrido, Fernando Martin, Ma...
SPAA
2006
ACM
14 years 4 months ago
A performance analysis of local synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout