Sciweavers

4114 search results - page 530 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
DEXA
2006
Springer
80views Database» more  DEXA 2006»
15 years 10 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
DMIN
2006
138views Data Mining» more  DMIN 2006»
15 years 8 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 8 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
AAAI
1996
15 years 8 months ago
Learning Models of Intelligent Agents
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
David Carmel, Shaul Markovitch
CCGRID
2010
IEEE
15 years 7 months ago
Asynchronous Communication Schemes for Finite Difference Methods on Multiple GPUs
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
Daniel P. Playne, Kenneth A. Hawick