4526 search results - page 124 / 906 » Algorithmic problems related to the Internet |
104
click to vote
ANOR
2007
15 years 4 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
122
Voted
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
147
click to vote
EMNLP
2011
14 years 3 months ago
2011
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
137
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
115
click to vote
MP
2002
15 years 3 months ago
2002
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...