1559 search results - page 65 / 312 » Some Group Theory Problems |
130
click to vote
CP
2004
Springer
15 years 3 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
DAM
2008
14 years 10 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
COCO
2004
Springer
15 years 1 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
104
click to vote
EC
1998
14 years 9 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
127
click to vote
ALDT
2011
Springer
13 years 9 months ago
2011
Springer
Security and sustainability are two critical global challenges that involve the interaction of many intelligent actors. Game theory provides a sound mathematical framework to model...