Sciweavers

13603 search results - page 231 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
WOA
2003
15 years 8 months ago
Using a Properties Based Naming System in Mobile Agents Environments for Pervasive Computing
— Mobile Agents model is widely accepted as a good solution to simplify the coordination in a complex and distributed environment. Pervasive computing, presents many issues regar...
Fabio Tarantino, Alessio Ravani, Mario Zambrini
CEC
2010
IEEE
15 years 7 months ago
Optimization of biogas production with computational intelligence a comparative study
Biogas plants are reliable sources of energy based on renewable materials including organic waste. There is a high demand from industry to run these plants efficiently, which lead...
Jörg Ziegenhirt, Thomas Bartz-Beielstein, Oli...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 7 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
BIB
2010
131views more  BIB 2010»
15 years 6 months ago
Multi-scale modelling in computational biomedicine
The inherent complexity of biomedical systems is well recognized; they are multi-scale, multi-science systems, bridging a wide range of temporal and spatial scales. This article r...
Peter M. A. Sloot, Alfons G. Hoekstra
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 6 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu