2636 search results - page 89 / 528 » Linear Programming |
TIT
2011
14 years 4 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
DAM
2008
14 years 10 months ago
2008
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
CISIS
2008
IEEE
15 years 4 months ago
2008
IEEE
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...