# Cryptographic Service Provider

## Papers overview

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

Highly Cited

2010

Highly Cited

2010

- IEEE Transactions on Biomedical Engineering
- 2010

Common spatial pattern (CSP) is a popular algorithm for classifying electroencephalogram (EEG) signals in the context of brainâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- SIGCOMM
- 2008

As peer-to-peer (P2P) emerges as a major paradigm for scalable network application design, it also exposes significant newâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- SIAM J. Comput.
- 2007

Â

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 2001

This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called theâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Annals of Mathematics and Artificial Intelligence
- 1999

Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm isâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- European Journal of Operational Research
- 1999

A constraint satisfaction problem (CSP) requires a value, selected from a given Â®nite domain, to be assigned to each variable inâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- IJCAI
- 1997

Filtering techniques are essential in order to ef ciently solve constraint satisfaction problems CSPs A blind search often leadsâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- IJCAI
- 1997

Constraint networks are used more and more to solve combinatorial problems in real-life applications. Much activity isâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- CP
- 1995

Abs t rac t . We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-searchâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- IJCAI
- 1993

Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numericâ€¦Â (More)

Is this relevant?