154 search results - page 15 / 31 » Approximated Consistency for Knapsack Constraints |
SIAMCOMP
2008
13 years 7 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
IJCAI
1997
13 years 8 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...
IS
2006
13 years 7 months ago
2006
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
AI
2011
Springer
13 years 2 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
ISCAS
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, a semi-blind channel estimation method is presented for MIMO-OFDM systems. The new method uses the linear prediction for obtaining a blind constraint on the MIMO...