Sciweavers

304 search results - page 48 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
PVLDB
2011
12 years 11 months ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
AAAI
2008
13 years 11 months ago
Computational Influence for Training and Entertainment
2) a set of abstract drama manager; 3) a model of player response to drama manager actions; and 4) an author-specified evaluation function. The drama manager's task is to sele...
David L. Roberts
JSW
2008
96views more  JSW 2008»
13 years 8 months ago
A Collaborative Inter-Data Grid Strong Semantic Model with Hybrid Namespace
The Data Grid, like all other collaboration models, has strict rules for contributors to follow and many criteria to abide with. Namespace is one of the rules that govern the contr...
Dalia El-Mansy, Ahmed Sameh
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 2 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
CP
2000
Springer
14 years 28 days 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