414 search results - page 61 / 83 » Integer Linear Programming Models for Global Routing |
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
ASPLOS
1996
ACM
13 years 11 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
CSFW
2009
IEEE
14 years 2 months ago
2009
IEEE
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
TNN
2010
13 years 2 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...