1480 search results - page 173 / 296 » Ants can solve constraint satisfaction problems |
174
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...
169
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
212
click to vote
QSHINE
2005
IEEE
16 years 3 days ago
2005
IEEE
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
173
click to vote
CCE
2004
15 years 6 months ago
2004
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
184
click to vote
ISQED
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...