2629 search results - page 130 / 526 » complex 2009 |
110
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
136
Voted
DLOG
2009
14 years 10 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
DSL
2009
14 years 10 months ago
2009
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...
116
Voted
GLOBECOM
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
ICDM
2009
IEEE
14 years 10 months ago
2009
IEEE
Climate change has been a challenging and urgent research problem for many related research fields. Climate change trends and patterns are complex, which may involve many factors a...