787 search results - page 105 / 158 » Polynomial Constants are Decidable |
143
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
122
click to vote
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
129
click to vote
AIPS
2006
15 years 5 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
133
click to vote
JGT
2008
15 years 4 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
145
click to vote
JOLLI
2006
15 years 4 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...