Sciweavers

840 search results - page 52 / 168
» The Complexity of the Extended GCD Problem
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Improving Interobserver Reliability by Artificial Intelligence Techniques in Behavioural Research
Interobserver reliability and reproducibility are well known problems in experimental research within the social and behavioural sciences. We propose the use of formal techniques ...
Arjen van Alphen, Tibor Bosse, Catholijn M. Jonker...
FSTTCS
2006
Springer
13 years 11 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
SPRINGSIM
2010
13 years 6 months ago
GTNA: a framework for the graph-theoretic network analysis
Concise and reliable graph-theoretic analysis of complex networks today is a cumbersome task, consisting essentially of the adaptation of intricate libraries for each specific pr...
Benjamin Schiller, Dirk Bradler, Immanuel Schweize...
ICALP
2009
Springer
14 years 8 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 8 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak