Sciweavers

4940 search results - page 646 / 988
» On the Complexity of Universal Programs
Sort
View
TABLEAUX
2005
Springer
16 years 4 days ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
183
Voted
PRICAI
2004
Springer
16 years 22 hour ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
193
Voted
CGO
2003
IEEE
15 years 12 months ago
Compiler Optimization-Space Exploration
To meet the performance demands of modern architectures, compilers incorporate an everincreasing number of aggressive code transformations. Since most of these transformations are...
Spyridon Triantafyllis, Manish Vachharajani, Neil ...
HICSS
2003
IEEE
101views Biometrics» more  HICSS 2003»
15 years 12 months ago
Omnisphere: a Personal Communication Environment
Small ubiquitous devices connected by wireless networks will become future Internet appliances. To support them, communication networks must evolve to seamlessly assist appliances...
Franck Rousseau, Justinian Oprescu, Laurentiu-Sori...
MOBICOM
2003
ACM
15 years 12 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano