611 search results - page 44 / 123 » Index Sets of Computable Structures with Decidable Theories |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
JACM
1998
13 years 7 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
IDEAS
2010
IEEE
13 years 6 months ago
2010
IEEE
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is...