Sciweavers

1507 search results - page 103 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
ECCC
2006
145views more  ECCC 2006»
13 years 10 months ago
Constraint satisfaction: a personal perspective
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...
Tomás Feder
BMCBI
2008
132views more  BMCBI 2008»
13 years 10 months ago
SCOWLP classification: Structural comparison and analysis of protein binding regions
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,...
ATAL
2010
Springer
13 years 11 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
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...
ANOR
2008
89views more  ANOR 2008»
13 years 10 months ago
Ordered sets with interval representation and ( m , n )-Ferrers relation
: 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...
Meltem Öztürk
WISE
2002
Springer
14 years 3 months ago
UTML: Unified Transaction Modeling Language
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...
Nektarios Gioldasis, Stavros Christodoulakis