4432 search results - page 494 / 887 » Solving Demodulation as an Optimization Problem |
143
click to vote
INFOVIS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
121
click to vote
DATE
1999
IEEE
15 years 8 months ago
1999
IEEE
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
115
Voted
ISPD
1999
ACM
15 years 8 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
131
click to vote
KR
1994
Springer
15 years 8 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
138
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider a slotted input-queued switch with a crossbar-like switching fabric. In each time-slot, a centralized scheduler determines a switching fabric configuration to transfer ...