455 search results - page 57 / 91 » Approximation Algorithms for Partial Covering Problems |
MKWI
2008
14 years 11 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
IJCAI
1997
14 years 11 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
ALGOSENSORS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...