1650 search results - page 214 / 330 » The HOM problem is decidable |
130
click to vote
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
171
click to vote
WIDM
2005
ACM
15 years 10 months ago
2005
ACM
In order to formulate a meaningful XML query, a user must have some knowledge of the schema of the XML documents to be queried. The query will succeed only if the schema of the ac...
129
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
130
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
141
Voted
TACAS
2005
Springer
15 years 10 months ago
2005
Springer
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...