2 resultados para path-relinking
em Bulgarian Digital Mathematics Library at IMI-BAS
Filtro por publicador
- Repository Napier (1)
- Rhode Island School of Design (1)
- Aberdeen University (2)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (3)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (10)
- Aston University Research Archive (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (83)
- Biodiversity Heritage Library, United States (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (26)
- Brock University, Canada (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- CaltechTHESIS (1)
- CentAUR: Central Archive University of Reading - UK (37)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (6)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (17)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (3)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (2)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (4)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (6)
- DigitalCommons@University of Nebraska - Lincoln (6)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (6)
- DRUM (Digital Repository at the University of Maryland) (3)
- Duke University (3)
- Düsseldorfer Dokumenten- und Publikationsservice (1)
- Fachlicher Dokumentenserver Paedagogik/Erziehungswissenschaften (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (5)
- Glasgow Theses Service (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institute of Public Health in Ireland, Ireland (1)
- Institutional Repository of Leibniz University Hannover (1)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Politécnico do Porto, Portugal (2)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Martin Luther Universitat Halle Wittenberg, Germany (3)
- National Center for Biotechnology Information - NCBI (4)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (369)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (2)
- RDBU - Repositório Digital da Biblioteca da Unisinos (1)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório da Produção Científica e Intelectual da Unicamp (15)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (75)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (7)
- Scielo Saúde Pública - SP (5)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (1)
- South Carolina State Documents Depository (1)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (12)
- Universidade do Minho (2)
- Universidade Federal do Pará (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universitat de Girona, Spain (2)
- Université de Lausanne, Switzerland (21)
- Université de Montréal (1)
- Université de Montréal, Canada (5)
- University of Connecticut - USA (3)
- University of Michigan (55)
- University of Queensland eSpace - Australia (38)
- University of Southampton, United Kingdom (1)
- WestminsterResearch - UK (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
A new approach is proposed for the quantum mechanics of guiding center motion in strong magnetic field. This is achieved by use of the coherent state path integral for the coupled systems of the cyclotron and the guiding center motion. We are specifically concerned with the effective action for the guiding center degree, which can be used to get the Bohr- Sommerfeld quantization scheme. The quantization rule is similar to the one for the vortex motion as a dynamics of point particles.
Resumo:
In this paper the network problem of determining all-pairs shortest-path is examined. A distributed algorithm which runs in O(n) time on a network of n nodes is presented. The number of messages of the algorithm is O(e+n log n) where e is the number of communication links of the network. We prove that this algorithm is time optimal.