Sciweavers

779 search results - page 140 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 6 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
CP
2000
Springer
13 years 11 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
BMCBI
2010
113views more  BMCBI 2010»
13 years 6 months ago
Use of historic metabolic biotransformation data as a means of anticipating metabolic sites using MetaPrint2D and Bioclipse
Background: Predicting metabolic sites is important in the drug discovery process to aid in rapid compound optimisation. No interactive tool exists and most of the useful tools ar...
Lars Carlsson, Ola Spjuth, Samuel Adams, Robert C....
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 8 months ago
Network-Aware Operator Placement for Stream-Processing Systems
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple...
Peter R. Pietzuch, Jonathan Ledlie, Jeffrey Shneid...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 11 days ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci