1568 search results - page 17 / 314 » The problem of examination questions in algorithmics |
SETN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
COR
2006
14 years 10 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
AE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
JCIT
2010
14 years 4 months ago
2010
It is quite difficult to adapt to the changing production scheduling problem for an algorithm of a certain question. According to this, a strategy of dynamic integrated iterative ...