Ambiguous name resolution

Known as: ANR 
Ambiguous Name Resolution (ANR) is a feature available in Microsoft's Active Directory which allows resolution of multiple objects on a computer… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2017
0102019892017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We investigate the quantifier alternation hierarchy in firstorder logic on finite words. Levels in this hierarchy are defined by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We address the problem of image upscaling in the form of single image super-resolution based on a dictionary of lowand… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2012
2012
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes… (More)
  • figure 1
Is this relevant?
2012
2012
We study a model in which an online platform makes a profit by auctioning an advertising slot that appears whenever a consumer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2012
2012
In the graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Replicating data under Eventual Consistency (EC) allows any replica to accept updates without remote synchronisation. This… (More)
  • figure 2
  • figure 3
Is this relevant?
2010
2010
A mobile robot represented by a point moving in the plane has to explore an unknown flat terrain with impassable obstacles. Both… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We consider a model for online computation in which the online algorithm receives, together with each request, some information… (More)
Is this relevant?
2004
2004
We begin by recalling that if Γ is a group, andH a subgroup of Γ, then Γ is calledH-separable if for every g ∈ Γ\H, there is a… (More)
Is this relevant?