Sciweavers

2657 search results - page 153 / 532
» On the complexity of hierarchical problem solving
Sort
View
JAIR
2010
130views more  JAIR 2010»
15 years 5 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
180
Voted
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 1 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
277
Voted
POPL
2008
ACM
16 years 7 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri
159
Voted
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
16 years 16 days ago
Reachability Analysis of Sampling Based Planners
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
Roland Geraerts, Mark H. Overmars
COLING
2008
15 years 8 months ago
Scaling up Analogical Learning
Recent years have witnessed a growing interest in analogical learning for NLP applications. If the principle of analogical learning is quite simple, it does involve complex steps ...
Philippe Langlais, François Yvon