Sciweavers

10899 search results - page 267 / 2180
» Wide Area Computation
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ISEM
2006
91views more  ISEM 2006»
15 years 7 months ago
Computational experimentations in market and supply-chain co-design: a mixed agent approach
The synthetic environment for analysis and simulations (SEAS) is a computational experimentation environment that mimics real life economies, with multiple interlinked markets, mul...
Alok R. Chaturvedi, Shailendra Raj Mehta, Daniel R...
JIB
2006
102views more  JIB 2006»
15 years 7 months ago
3D image and graph based Computation of Protein Surface
The accessible surface of a macromolecule is a significant determinant of its action. The interaction between biomolecules or protein-ligand is dependent on their surfaces rather ...
A. Ranganath, K. C. Shet, N. Vidyavathi
ERCIM
2007
125views more  ERCIM 2007»
15 years 7 months ago
Workflow Management Systems for Grid Computing
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
Carmen Bratosin, Wil M. P. van der Aalst
SYNTHESE
2008
88views more  SYNTHESE 2008»
15 years 7 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette