4342 search results - page 240 / 869 » Improved Algorithms for Optimal Embeddings |
181
click to vote
CSC
2009
15 years 6 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
173
click to vote
IPCO
2010
15 years 3 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
160
click to vote
TWC
2010
15 years 5 days ago
2010
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
142
click to vote
MMSEC
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents a high-capacity method to embed information into the geometry of a 3D polygonal mesh. The method extends a previously reported work, to which several improveme...
160
click to vote
RTCSA
1999
IEEE
15 years 9 months ago
1999
IEEE
Data Broadcast in mobile environments has received much attention in recent years and a large number of algorithms proposed. However, existing work in the literature only assume a ...