




Groupbased Cryptography (Advanced Courses in Mathematics  CRM Barcelona)
This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how noncommutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown...   Discrete Mathematics and its Applications
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced...   

Constraint Satisfaction Techniques for AgentBased Reasoning
An important aspect of multi agent systems are agent reasoning techniques for problem solving, either at the level of a single agent or at the level of distributed collaboration amongst multiple agents.
Constraint Satisfaction Problems (CSP) prove to be a generic framework which can be applied for modeling and solving a wide range...   Introduction to Evolutionary Algorithms (Decision Engineering)
Evolutionary algorithms are becoming increasingly attractive across various disciplines, such as operations research, computer science, industrial engineering, electrical engineering, social science and economics. Introduction to Evolutionary Algorithms presents an insightful, comprehensive, and uptodate treatment of evolutionary algorithms....   The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1
The TITLE of Volume 4 is Combinatorial Algorithms, and when I proposed it I was strongly inclined to add a subtitle: The Kind of Programming I Like Best. Mv editors have decided to tone down such exuberance, but the fact remains that programs with a combinatorial flavor have always been my favorites.
On the other hand I've... 



Result Page: 13 12 11 10 9 8 7 6 5 4 