95 search results - page 12 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
Applications such as traffic management and resource scheduling for location-based services commonly need to identify regions with high concentrations of moving objects. Such quer...
CHI
2005
ACM
14 years 9 months ago
2005
ACM
Domestic ubicomp applications often assume individual users will program and configure their technology in isolation, decoupled from complex domestic environments in which they ar...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
Concurrency-related bugs may happen when multiple threads access shared data and interleave in ways that do not correspond to any sequential execution. Their absence is not guaran...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
A recently introduced information-theoretic approach to analyzing redundancies in database design was used to justify normal forms like BCNF that completely eliminate redundancies...