194 search results - page 6 / 39 » Some problems, I care most |
SODA
2012
ACM
13 years 21 hour ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
ALGORITHMICA
2010
14 years 9 months ago
2010
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...