1220 search results - page 151 / 244 » Restricting grammatical complexity |
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
NTMS
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless Sensor Networks (WSNs) have been of high interest during the past couple of years. One of the most important aspects of WSN research is location estimation. As a good s...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— Although there has been an increasing interest in dynamic bipedal locomotion for significant improvement of energy efficiency and dexterity of mobile robots in the real world...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
CIVR
2009
Springer
14 years 2 months ago
2009
Springer
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...