Sciweavers

241 search results - page 9 / 49
» Four Paths to AI
Sort
View
AIPS
2009
13 years 8 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
AI
2005
Springer
13 years 7 months ago
Semiotic schemas: A framework for grounding language in action and perception
A theoretical framework for grounding language is introduced that provides a computational path from sensing and motor action to words and speech acts. The approach combines conce...
Deb Roy
SIAMCOMP
2010
93views more  SIAMCOMP 2010»
13 years 2 months ago
Tightening Nonsimple Paths and Cycles on Surfaces
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
Éric Colin de Verdière, Jeff Erickso...
IPPS
2005
IEEE
14 years 1 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
VLDB
2007
ACM
119views Database» more  VLDB 2007»
14 years 7 months ago
Path and cache conscious prefetching (PCCP)
Main memory cache performance continues to play an important role in determining the overall performance of object-oriented, object-relational and XML databases. An effective metho...
Zhen He, Alonso Marquez