20066 search results - page 269 / 4014 » T Spaces |
157
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
181
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
We have developed a set of tools to allow the use of model-checking techniques for the verification of systems directly implemented in an agent-oriented programming language. The ...
186
click to vote
COOPIS
2004
IEEE
15 years 10 months ago
2004
IEEE
Increasing demands for interconnectivity, adaptivity and flexibility are leading to distributed component-based systems (DCBS) where components may dynamically join and leave a sys...
225
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
145
click to vote
AAAI
2008
15 years 9 months ago
2008
Machine learning approaches to indoor WiFi localization involve an offline phase and an online phase. In the offline phase, data are collected from an environment to build a local...