Sciweavers

4198 search results - page 142 / 840
» In search of lost time
Sort
View
GCB
2004
Springer
91views Biometrics» more  GCB 2004»
15 years 12 months ago
A Method for Fast Approximate Searching of Polypeptide Structures in the PDB
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
Hanjo Täubig, Arno Buchner, Jan Griebsch
EPS
1998
Springer
15 years 10 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
CP
2004
Springer
15 years 10 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
AICT
2006
IEEE
130views Communications» more  AICT 2006»
15 years 8 months ago
A Search Theoretical Approach to P2P Networks: Analysis of Learning
One of the main characteristics of the peer-to-peer systems is the highly dynamic nature of the users present in the system. In such a rapidly changing enviroment, end-user guaran...
Nazif Cihan Tas, Bedri Kamil Onur Tas
EOR
2006
139views more  EOR 2006»
15 years 6 months ago
A critical-shaking neighborhood search for the yard allocation problem
The yard allocation problem (YAP) is a real-life resource allocation problem faced by the Port of Singapore Authority (PSA). As the problem is NP-hard, we propose an effective met...
Andrew Lim, Zhou Xu