Sciweavers

239 search results - page 47 / 48
» Complete Geometrical Query Languages
Sort
View
WISE
2005
Springer
14 years 28 days ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
JODL
2000
194views more  JODL 2000»
13 years 7 months ago
An open electronic marketplace through agent-based workflows: MOPPET
We propose an electronic marketplace architecture, called MOPPET, where the commerce processes in the marketplace are modeled as adaptable agent-based workflows. The higher level ...
Sena Nural Arpinar, Asuman Dogac, Nesime Tatbul
AIIDE
2008
13 years 9 months ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 1 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine