Browsing by Title
Now showing items 4527-4546 of 7593
-
Palladium (II) and platinum (II) complexes of bis(4-methoxyphenyltelluro) methane. Crystal structure of [{meso-(4-MeOC6H4Te)2CH2} (Ph2PCH2CH2PPh2) PD(II)]-(ClO4)2· 4H2O and [meso-(4-MeOC6H4Te)2CH2]Pd(II)Cl2
(1997)Palladium (II) and platinum (II) complexes of the chelating ditelluroether ligand, (MeOC6H4Te)2CH2, have been prepared and characterised by IR, UV-Vis and multinuclear (1H, 125Te{1H}, 195Pt{1H}) NMR spectroscopy and chemical ... -
Palladium capped samarium thin films as potential hydrogen sensors
(2004)We show here that a palladium capped samarium film at room temperature can be used as an efficient sensor material for hydrogen detection. As low as 194 ppm of hydrogen gas can be detected without any cross sensitivity ... -
Pamuk's Istanbul: everyday architecture
(IIT Delhi, 2016) -
Para-Bose Operators,coherent states and applications
(IIT Delhi, 1979) -
Parallel algorithms for the solution of tridiagonal and banded linear systems
(IIT Delhi, 1993) -
Parallel cholesky factorization and related operations for sparse matrices
(IIT Delhi, 1993)Abstract/summary available in content.pdf -
Parallel delaunay tringulation for finite element methods
(IIT Delhi, 1999) -
Parallel dictionary operations algorithms and architectures.
(IIT Delhi, 1995) -
A parallel mesh chopping algorithm for a class of two-point boundary value problems
(1998)A parallel algorithm for the class of two-point boundary value problems y″ = f(x,y), y(0) = A, y(1) = B with and continous on [0,1] × (−∞, ∞) is presented. Using an idea similar to that in [1], we divide [0,1] into p ... -
Parallel search-and-learn technique for solving large scale travelling-salesperson problems
(1994)Parallel processing has traditionally been used to achieve higher speed while solving computational problems of large size. The greater availability of parallel and distributed computing opens yet another dimension, where ... -
A parallel search-and-learn technique for solving large scale TSP
(1993)Describes a parallel search-and-learn technique for obtaining high quality solutions to the traveling salesperson problem (TSP). The combinatorial search space is decomposed so that multiple processors can simultaneously ... -
Parallel techniques for solving large scale travelling salesperson problems
(1992)As a hard combinatorial optimization problem, the travelling salesperson problem (TSP) has been of pedagogical interest for more than 50 years. More recently, the problem has generated a great deal of practical interest ... -
Parallelization of symmetry detection algorithms on a network of workstations
(1997)Detection of spatial symmetry is useful in several computer vision applications. Due to the real-time nature of the applications, it is important that symmetry detection algorithms be computationally efficient. Sequential ...