206 search results - page 17 / 42 » mp 2006 |
MP
2010
14 years 8 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
MP
2002
14 years 9 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Multimedia applications communicating over a next generation VPN architecture that allows selective encryption can leverage the security properties of a VPN with its performanc...
FGCS
2006
14 years 9 months ago
2006
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper examines how various carrier-sensing schemes affect the exposed-node (EN) and hidden-node (HN) phenomena. In the process, we identify a new carrier-sensing mechanism fo...