994 search results - page 32 / 199 » Custom Computing Machines for the Set Covering Problem |
112
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
111
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Gesture recognition is a difficult task in computer vision due to the numerous degrees of freedom of a human hand. Fortunately, human gesture covers only a small part of the theor...
79
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
128
Voted
JCSS
2008
15 years 24 days ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
111
Voted
NETWORKS
2007
15 years 9 days ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...