Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Background: Detailed information about protein interactions is critical for our understanding of the principles governing protein recognition mechanisms. The structures of many pr...
Joan Teyra, Maciej Paszkowski-Rogacz, Gerd Anders,...
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
: Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of orde...
Web transactions may be complex, composed of several sub-transactions accessing different resources including legacy systems. They may also have complex semantics. To deal with co...