Meld (software)

Known as: Meld 
Meld is the visual diff and merge tool of GNOME targeted at developers. It allows users to compare two or three files or directories visually, color… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1959-2016
051019592016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Self-reconfiguration for moving MEMS microrobots currently needs a positioning system and a map of the target shape. Traditional… (More)
  • figure 2
  • figure 1
  • figure 5
  • figure 6
  • figure 9
Is this relevant?
2013
2013
MEMS microrobots are low-power and low-memory capacity devices that can sense and act. One of the most difficult challenges in… (More)
  • figure 1
  • figure 5
  • figure 8
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot… (More)
  • figure 1
  • figure 7
  • figure 9
  • figure 8
  • figure 10
Is this relevant?
2006
2006
The representation of hierarchically structured knowledge in systems using distributed patterns of activity is an abiding concern… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
  • Seth Pettie
  • 46th Annual IEEE Symposium on Foundations of…
  • 2005
Fredman, Sedgewick, Sleator and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
We meld two traditional approaches to managing a valued resource. The first is restoring its quality. The second is curbing its… (More)
  • table 1
  • table B.1
  • table C.1
  • table C.2
  • table C.3
Is this relevant?
2002
2002
Bootstrapping is a widely employed technique in the process of building highly complex systems such as microprocessors, language… (More)
Is this relevant?
2000
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert… (More)
  • figure 1
Is this relevant?
2000
2000
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
We present priority queues that support the operations MakeQueue, FindMin, Insert and Meld in worst case time O(1) and Delete and… (More)
Is this relevant?