393 search results - page 74 / 79 » Convex Programming Methods for Global Optimization |
EMSOFT
2011
Springer
12 years 7 months ago
2011
Springer
Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective a...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
COR
2010
13 years 7 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...