NUMERICS.bib

@COMMENT{{This file has been generated by bib2bib 1.46}}

@COMMENT{{Command line: bib2bib -ob NUMERICS.bib -c " ropsections:'NUMERICS' " bigBiblioFile.bib}}

@COMMENT{{ bigBiblioFile.bib generated by makebib.sh version }}

@COMMENT{{ concatenation of journals_ref.bib withpyblio.bib optimization.bib mypapers.bib other.bib refvulg.bib these_ref.bib philo.bib ../math/journals_ref.bib ../math/citeseer.bib ../math/books.bib }}

@COMMENT{{ date: Thu Nov 2 00:20:16 CET 2006 }}


@MISC{chandrasekharan2002meron,
  AUTHOR = {S. Chandrasekharan and J. Cox and J.C. Osborn and
                  U.-J. Wiese },
  TITLE = {Meron-Cluster Approach to Systems of Strongly
                  Correlated Electrons},
  YEAR = {2002},
  ROPSECTIONS = {CORREL NUMERICS},
  URL = {http://fr.arxiv.org/abs/cond-mat/0201360},
  PS = {/sci_docs/physics/papers/arxiv/chandrasekharan2002meron.ps.gz},
  ABSTRACT = {Numerical simulations of strongly correlated
                  electron systems suffer from the notorious fermion
                  sign problem which has prevented progress in
                  understanding if systems like the Hubbard model
                  display high-temperature superconductivity. Here we
                  show how the fermion sign problem can be solved
                  completely with meron-cluster methods in a large
                  class of models of strongly correlated electron
                  systems, some of which are in the extended Hubbard
                  model family and show s-wave superconductivity. In
                  these models we also find that on-site repulsion can
                  even coexist with a weak chemical potential without
                  introducing sign problems. We argue that since these
                  models can be simulated efficiently using cluster
                  algorithms they are ideal for studying many of the
                  interesting phenomena in strongly correlated
                  electron systems.}
}


@MISC{blaha2002classical,
  OPTKEY = {},
  AUTHOR = {Stephen Blaha},
  TITLE = {A Classical Probabilistic Computer Model of
                  Consciousness},
  OPTHOWPUBLISHED = {},
  OPTMONTH = {},
  YEAR = {2002},
  OPTNOTE = {},
  OPTANNOTE = {},
  ROPSECTIONS = {MISC NUMERICS CONSCIOUS},
  URL = {http://fr.arxiv.org/abs/physics/0201051},
  PDF = {/sci_docs/physics/papers/arxiv/blaha2002classical.pdf},
  ABSTRACT = { We show that human consciousness can be modeled as
                  a classical (not quantum) probabilistic computer. A
                  quantum computer representation does not appear to
                  be indicated because no known feature of
                  consciousness depends on Planck's constant h, the
                  telltale sign of quantum phenomena. It is argued
                  that the facets of consciousness are describable by
                  an object-oriented design with dynamically defined
                  classes and objects. A comparison to economic theory
                  is also made. We argue consciousness may also have
                  redundant, protective mechanisms.}
}


@ARTICLE{boettcher2002jamming,
  AUTHOR = {Stefan Boettcher and Michelangelo Grigni},
  TITLE = {Jamming model for the extremal optimization
                  heuristic},
  JOURNAL = {J. Phys. A: Math. Gen},
  YEAR = {2002},
  VOLUME = {35},
  OPTNUMBER = {},
  PAGES = {1109-1123},
  OPTMONTH = {February},
  ROPSECTIONS = {NUMERICS PHYSX},
  PDF = {/sci_docs/physics/papers/JPhysA/boettcher2002jamming/pdf},
  ABSTRACT = {Extremal optimization, a recently introduced
                  meta-heuristic for hard optimization problems, is
                  analysed on a simple model of jamming. The model is
                  motivated first by the problem of finding lowest
                  energy configurations for a disordered spin system
                  on a fixed-valence graph. The numerical results for
                  the spin system exhibit the same phenomenology found
                  in all earlier studies of extremal optimization, and
                  our analytical results for the model reproduce many
                  of these features.}
}

@COMMENT{{ThisfilehasbeengeneratedbyPybliographer}}