3937 search results - page 561 / 788 » Questioning Ubiquitous Computing |
118
click to vote
CPC
2004
15 years 2 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
111
click to vote
IGPL
1998
15 years 2 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
115
Voted
WG
2010
Springer
15 years 28 days ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
144
Voted
WG
2010
Springer
15 years 28 days ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
181
click to vote
WINE
2010
Springer
15 years 13 days ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...