Sciweavers

1012 search results - page 30 / 203
» Segment intersection searching problems in general settings
Sort
View
ATAL
2010
Springer
15 years 26 days ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
15 years 3 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
ICCSA
2004
Springer
15 years 5 months ago
A Sequence-Focused Parallelisation of EMBOSS on a Cluster of Workstations
Abstract. A number of individual bioinformatics applications (particularly BLAST and other sequence searching methods) have recently been implemented over clusters of workstations ...
Karl Podesta, Martin Crane, Heather J. Ruskin
FASE
2009
Springer
15 years 6 months ago
SNIFF: A Search Engine for Java Using Free-Form Queries
Reuse of existing libraries simplifies software development efforts. However, these libraries are often complex and reusing the APIs in the libraries involves a steep learning cu...
Shaunak Chatterjee, Sudeep Juvekar, Koushik Sen
VLDB
2002
ACM
188views Database» more  VLDB 2002»
14 years 11 months ago
Continuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
Yufei Tao, Dimitris Papadias, Qiongmao Shen