10988 search results - page 222 / 2198 » Algorithmic Folding Complexity |
133
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
125
click to vote
VTC
2007
IEEE
15 years 10 months ago
2007
IEEE
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
122
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
145
Voted
EGH
2003
Springer
15 years 9 months ago
2003
Springer
We present a novel approach for fast collision detection between multiple deformable and breakable objects in a large environment using graphics hardware. Our algorithm takes into...
152
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...