4117 search results - page 52 / 824 » On the Satisfiability of Complex Constraints |
118
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
PAMI
2007
14 years 11 months ago
2007
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...
107
click to vote
AAAI
2004
15 years 1 months ago
2004
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
107
click to vote
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...