4674 search results - page 396 / 935 » cases 2008 |
184
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
142
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
159
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
211
click to vote
RAS
2008
15 years 5 months ago
2008
This work is about solving the global localization issue for mobile robots operating in large and cooperative environments. It tackles the problem of estimating the pose of a robo...
185
click to vote
COMPSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
In this article, we address the problem of modularizing legacy applications with monolithic structure, primarily focusing on business software written in an objectoriented program...