9176 search results - page 458 / 1836 » algorithms 2010 |
160
click to vote
ENDM
2010
15 years 6 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
140
click to vote
ENDM
2010
15 years 6 months ago
2010
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
171
click to vote
ECCC
2006
15 years 6 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
205
click to vote
ECCC
2006
15 years 6 months ago
2006
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
176
click to vote
ENDM
2006
15 years 6 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...