10988 search results - page 174 / 2198 » Algorithmic Folding Complexity |
131
Voted
CP
2003
Springer
15 years 8 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
225
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Recent work both in the relational and the XML world have shown that the efficacy and efficiency of duplicate detection is enhanced by regarding relationships between entities. Ho...
151
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
121
Voted
VTC
2008
IEEE
15 years 10 months ago
2008
IEEE
—Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for future wide-area mobile communications, which can provide scalable high data rate tra...
145
Voted
AIIA
2007
Springer
15 years 9 months ago
2007
Springer
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...