Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of… Expand

Is this relevant?

2012

2012

Generic decidability has been extensively studied in group theory, and we now study it in the context of classical computability… Expand

Is this relevant?

2011

2011

Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important… Expand

Is this relevant?

2007

2007

This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of… Expand

Is this relevant?

2006

2006

Refactoring is about changing the design of existing code without changing its behaviour, but with the aim of making code easier… Expand

Is this relevant?

2005

2005

It is widely acknowledged that the system functionality captured in a system model has to match organisational requirements… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We present an efficient particle filtering method to perform optimal estimation in jump Markov (nonlinear) systems (JMSs). Such… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Abstract We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Abstract If A is a weak C *-Hopf algebra then the category of finite-dimensional unitary representations of A is a monoidal C… Expand

Is this relevant?