1139 search results - page 141 / 228 » Bounded Ideation Theory |
GECCO
2010
Springer
13 years 12 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...