4372 search results - page 260 / 875 » Algorithmic Theories of Everything |
162
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
156
click to vote
ICTAC
2004
Springer
15 years 11 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
189
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably ...
150
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
149
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...