1568 search results - page 26 / 314 » The problem of examination questions in algorithmics |
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
PR
2008
14 years 10 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...