9716 search results - page 342 / 1944 » The Case for Energy-Proportional Computing |
195
Voted
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
206
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
184
click to vote
NC
2010
15 years 5 months ago
2010
Abstract. Inspired by P systems initiated by Gheorghe P˜aun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of fini...
194
Voted
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
High-end mobile phones are quickly becoming versatile sensing platforms, capable of continuously capturing the dynamic context of their owners through various sensors. A change in...
170
click to vote
TCS
2010
15 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...