2100 search results - page 204 / 420 » Fundamentals of the problem |
105
click to vote
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
121
Voted
GCA
2008
15 years 2 months ago
2008
In a Grid Computing environment, there are various important issues, including information security, resource management, routing, fault tolerance, and so on. Among these issues, ...
111
Voted
CVPR
2010
IEEE
14 years 10 months ago
2010
IEEE
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
109
click to vote
CCGRID
2009
IEEE
15 years 7 months ago
2009
IEEE
— Unpredictable access to batch-mode HPC resources is a significant problem for emerging dynamic data-driven applications. Although efforts such as reservation or queue-time pred...
100
click to vote
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...