Showing 541 - 560 results of 21,030 for search '"multiplication"', query time: 0.09s Refine Results
  1. 541
  2. 542
  3. 543

    An Extrapolated Iterative Algorithm for Multiple-Set Split Feasibility Problem by Yazheng Dang, Yan Gao

    Published 2012-01-01
    “…Censor et al. (2005) proposed a method for solving the multiple-set split feasibility problem (MSSFP), whose efficiency depends heavily on the step size, a fixed constant related to the Lipschitz constant of ∇p(x) which may be slow. …”
    Get full text
    Article
  4. 544

    Multiple Pigmented Bowen’s Disease: A Diagnostic and Therapeutic Dilemma by Pratik Gahalaut, Madhur Kant Rastogi, Nitin Mishra, Sandhya Chauhan

    Published 2012-01-01
    “…Extensive literature research failed to reveal any case of multiple pigmented BD in type V Fitzpatrick skin. Multiple BD is a therapeutic challenge with a tendency to recur. …”
    Get full text
    Article
  5. 545
  6. 546

    The Impact of Osteopontin Gene Variations on Multiple Sclerosis Development and Progression by Cristoforo Comi, Giuseppe Cappellano, Annalisa Chiocchetti, Elisabetta Orilieri, Sara Buttini, Laura Ghezzi, Daniela Galimberti, Franca Guerini, Nadia Barizzone, Franco Perla, Maurizio Leone, Sandra D’Alfonso, Domenico Caputo, Elio Scarpini, Roberto Cantello, Umberto Dianzani

    Published 2012-01-01
    “…Several reports suggest its involvement in multiple sclerosis (MS) pathogenesis. We previously reported that OPN gene variations at the 3′ end are a predisposing factor for MS development and evolution. …”
    Get full text
    Article
  7. 547
  8. 548
  9. 549
  10. 550
  11. 551
  12. 552
  13. 553
  14. 554
  15. 555

    Link-disjoint routing algorithm under multiple additive QoS constraints by XIONG Ke1, QIU Zheng-ding1, ZHANG Yu1, ZHANG Hong-ke3

    Published 2010-01-01
    “…The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path routing algorithm(MCLPRA) was proposed.MCLPRA was based on SAMCRA and didn’t rely on the network’s structure.By introducing the parameter to control its search depth,dividing the solution space into different classes and performing searching according to the classes respectively,MCLPRA was able to obtain the feasible solutions for arbitrary networks.Theoretic analysis shows that MCLPRA can get the feasible and optimal solutions when traditional schemes can not.Comprehensive simulations also show that MCLPRA has better performances than existing algorithms in terms of higher average successful rate of getting feasible solutions with shorter average total length of the obtained path pair.…”
    Get full text
    Article
  16. 556
  17. 557

    Multiple solutions for singularly perturbed semilinear elliptic equations in bounded domains by Michinori Ishiwata

    Published 2005-01-01
    “…We are concerned with the multiplicity of solutions of the following singularly perturbed semilinear elliptic equations in bounded domains Ω:−ε2Δu+a(⋅)u=u|u|p−2 in Ω, u>0 in Ω, u=0 on ∂Ω. …”
    Get full text
    Article
  18. 558
  19. 559

    Numerical Simulation of Multiplicity and Stability of Mixed Convection in Rotating Curved Ducts by Liqiu Wang, Tianliang Yang

    Published 2005-01-01
    “…Dynamic responses of the multiple solutions to finite random disturbances are examined by the direct transient computation. …”
    Get full text
    Article
  20. 560