1650 search results - page 237 / 330 » The HOM problem is decidable |
178
click to vote
EUROSYS
2008
ACM
16 years 3 months ago
2008
ACM
Non-uniform utilization of functional units in combination with hardware mechanisms such as clock gating leads to different power consumptions in different parts of a processor ch...
157
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
198
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
185
click to vote
PPPJ
2009
ACM
16 years 1 months ago
2009
ACM
Accelerated graphics cards, or Graphics Processing Units (GPUs), have become ubiquitous in recent years. On the right kinds of problems, GPUs greatly surpass CPUs in terms of raw ...
149
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...