1568 search results - page 92 / 314 » The problem of examination questions in algorithmics |
140
click to vote
TSMC
2008
15 years 4 months ago
2008
Graphical representation may provide effective means of making sense of the complexity and sheer volume of data produced by DNA microarray experiments that monitor the expression p...
147
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
140
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
124
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
167
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...