1547 search results - page 101 / 310 » Solving Knapsack Problems in a Sticker Based Model |
118
Voted
ATMOS
2010
15 years 2 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
126
click to vote
NIPS
2008
15 years 4 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
107
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Where am I and what am I seeing? This is a classical vision problem and this paper presents a solution based on efficient use of a combination of 2D and 3D features. Given a model...
121
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Although, computational Grid has been initially developed to solve large-scale scientific research problems, it is extended for commercial and industrial applications. An interest...
142
click to vote
CCGRID
2006
IEEE
15 years 9 months ago
2006
IEEE
One of the key requirement for Grid infrastructures is the ability to share resources with nontrivial qualities of service. However, resource management in a decentralized infrast...