6274 search results - page 998 / 1255 » From query complexity to computational complexity |
250
click to vote
AI
2011
Springer
15 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...
208
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
263
click to vote
SIGECOM
2011
ACM
14 years 10 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
461
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
175
click to vote
DAC
2004
ACM
16 years 8 months ago
2004
ACM
Reconfigurable Systems-on-Chip (SoCs) on the market consist of full-fledged processors and large Field-Programmable Gate-Arrays (FPGAs). The latter can be used to implement the sy...