# Loop variant

## Papers overview

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

Highly Cited

2011

Highly Cited

2011

- IEEE Transactions on Vehicular Technology
- 2011

In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channelâ€¦Â (More)

Is this relevant?

2007

2007

- 13th IEEE Real Time and Embedded Technology andâ€¦
- 2007

Device drivers are integral components of operating systems. The computational workloads imposed by device drivers tend to beâ€¦Â (More)

Is this relevant?

2007

2007

- IJCAI
- 2007

In this paper we present a general logical framework for (weighted) MAX-SAT problem, and study properties of inference rules forâ€¦Â (More)

Is this relevant?

2007

2007

- SIAM Journal on Optimization
- 2007

We introduce a notion of quasi-regularity for points with respect to the inclusion F (x) âˆˆ C where F is a nonlinear FrechÃ©tâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Social Choice and Welfare
- 2006

A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluationâ€¦Â (More)

Is this relevant?

2004

2004

- AAAI
- 2004

Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithmâ€¦Â (More)

Is this relevant?

2001

2001

- CIKM
- 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warpingâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- AAAI/IAAI, Vol. 1
- 1996

If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears thatâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- FPCA
- 1989

One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-caseâ€¦Â (More)

Is this relevant?

1985

1985

- PODC
- 1985

Algorithms for election in asynchronous general networks and in synchronous rings are presented. The algorithms are messageâ€¦Â (More)

Is this relevant?