Sciweavers

424 search results - page 14 / 85
» Realizability models and implicit complexity
Sort
View
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 11 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
14 years 1 months ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
CGI
2006
IEEE
14 years 1 months ago
Sketch Based Mesh Fusion
The modelling method for creating 3D models in an intuitive way is far from satisfactory. In this paper, we develop a novel mesh fusion method controlled by sketches, which allows...
Juncong Lin, Xiaogang Jin, Charlie C. L. Wang
FIDJI
2003
Springer
14 years 21 days ago
Seamless UML Support for Service-Based Software Architectures
The UML has become the de facto standard for the analysis and design of complex software. Tool support today includes the generation of code realizing the structural model describe...
Matthias Tichy, Holger Giese
CEEMAS
2007
Springer
14 years 1 months ago
An Architecture and Framework for Agent-Based Web Applications
The construction of web applications is a complex task as different kinds of technologies need to be integrated. To ease the task of developing web applications many different we...
Alexander Pokahr, Lars Braubach