1381 search results - page 194 / 277 » Computational Complexity of Constraint Satisfaction |
POLICY
2005
Springer
14 years 3 months ago
2005
Springer
The use of policy-based mechanisms significantly reduces the complexity associated with applicational development and operation. In particular, history-based policies allow the s...
ARCS
2004
Springer
14 years 3 months ago
2004
Springer
: Mechatronic units are characterized by a complex interaction of functions from mechanics, electronics, communication and computer systems. These different fields of technology as...
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of anomaly detection in multiple co-evolving data streams. In this paper, we introduce FRAHST (Fast Rank-Adaptive row-Householder Subspace Tracking). It au...
COCO
2008
Springer
13 years 12 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...