4491 search results - page 552 / 899 » Algorithm Engineering |
142
click to vote
FOSSACS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
171
click to vote
FSTTCS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
169
click to vote
PERVASIVE
2007
Springer
16 years 20 days ago
2007
Springer
Although the privacy threats and countermeasures associated with location data are well known, there has not been a thorough experiment to assess the effectiveness of either. We ex...
175
click to vote
SARA
2007
Springer
16 years 19 days ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
178
click to vote
COMSWARE
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we propose a framework for fault repair in mobile sensor networks. A hierarchical structure which consists of replacement module, management policy module, knowl...