Sciweavers

5326 search results - page 1065 / 1066
» On what we can ensure
Sort
View
NDJFL
2010
13 years 17 days ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen
DRUMS
1998
Springer
13 years 10 months ago
Handling uncertainty in control of autonomous robots
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...
Alessandro Saffiotti
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
AAAI
2007
13 years 8 months ago
Learning by Reading: A Prototype System, Performance Baseline and Lessons Learned
A traditional goal of Artificial Intelligence research has been a system that can read unrestricted natural language texts on a given topic, build a model of that topic and reason...
Ken Barker, Bhalchandra Agashe, Shaw Yi Chaw, Jame...
CODES
2005
IEEE
13 years 11 months ago
Spatial division multiplexing: a novel approach for guaranteed throughput on NoCs
To ensure low power consumption while maintaining flexibility and performance, future Systems-on-Chip (SoC) will combine several types of processor cores and data memory units of...
Anthony Leroy, Paul Marchal, Adelina Shickova, Fra...
« Prev « First page 1065 / 1066 Last » Next »