514 search results - page 45 / 103 » On enumerating all minimal solutions of feedback problems |
191
click to vote
LCPC
1997
Springer
15 years 10 months ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
155
click to vote
EOR
2010
15 years 6 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
178
click to vote
ISPD
2004
ACM
16 years 3 days ago
2004
ACM
Considering the voltage drop constraint over a distributed model for power/ground (P/G) network, we study the following two problems for physical synthesis of sleep transistors: t...
146
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
161
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...