4940 search results - page 151 / 988 » On the Complexity of Universal Programs |
144
click to vote
JAPLL
2010
14 years 11 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
205
click to vote
ICDE
2012
IEEE
13 years 7 months ago
2012
IEEE
—Motion sensing input devices like Microsoft’s Kinect offer an alternative to traditional computer input devices like keyboards and mouses. Daily new applications using this in...
144
Voted
GD
2005
Springer
15 years 10 months ago
2005
Springer
A workshop on Network Analysis and Visualisation was held on September 11, 2005 in Limerick Ireland, in conjunction with 2005 Graph Drawing conference. This report review the backg...
178
click to vote
DAC
2000
ACM
16 years 5 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
123
click to vote
CSR
2009
Springer
15 years 11 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...