Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Name binding

Known as: Binding, Dynamic polymorphism, Binding time 
In programming languages, name binding is the association of entities (data and/or code) with identifiers. An identifier bound to an object is said… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Die plattformunabhangige Beschreibung von Schnittstellen ist ein wichtiger Baustein fur eine Service-orientierte Architektur… Expand
Highly Cited
2005
Highly Cited
2005
Software engineers are faced with a dilemma. They want to write general and wellstructured programs that are flexible and easy to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
This paper formalises within first-order logic some common practices in computer science to do with representing and reasoning… Expand
Highly Cited
1999
Highly Cited
1999
A strong positive association between one's school attainment and that of one's parents has been consistently documented in… Expand
Highly Cited
1998
Highly Cited
1998
A novel and robust automated docking method that predicts the bound conformations of flexible ligands to macromolecular targets… Expand
  • figure 1
  • table I
  • table II
  • table III
  • figure 3
Highly Cited
1985
Highly Cited
1985
Effective interresidue contact energies for proteins in solution are estimated from the numbers of residue-residue contacts… Expand
  • figure 1
  • figure 2
  • table I
  • table I
  • table 111
Highly Cited
1985
Highly Cited
1985
Binding of the chiral metal complexes [Ru(bpy),]CI, (I), [ R ~ ( p h e n ) ~ ] C l ~ (11), and [Ru(DIP),]CI2 (111) to calf thymus… Expand
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 3
Highly Cited
1985
Highly Cited
1985
This paper presents models in which one agent must decide whether to trust another, whose motives are uncertain. Reliability can… Expand
Highly Cited
1984
Highly Cited
1984
The classical optimal power flow problem with a nonseparable objective function can be solved by an explicit Newton approach… Expand
  • figure 1
  • table I
Highly Cited
1946
Highly Cited
1946
  • T. R. Forbes
  • The Yale Journal of Biology and Medicine
  • 1946
  • Corpus ID: 1419659
Prof. Patten states in the Preface that his -book "represents an endeavor to set forth in simple and readable form the phases of… Expand