1998 search results - page 175 / 400 » Complexity of the Cover Polynomial |
250
click to vote
HOLOMAS
2009
Springer
15 years 11 months ago
2009
Springer
The paper gives overview of a multi-agent real-time scheduler for the European operation of one of the largest rent-a-car company in the world. It describes requirements for schedu...
180
click to vote
COMPCON
1994
IEEE
15 years 10 months ago
1994
IEEE
A fully asynchronous implementation of the ARM microprocessor has been developed in order to investigate the potential of asynchronous logic for low-power applications. The work d...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
184
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
156
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...