Sciweavers

234 search results - page 33 / 47
» On Bus Graph Realizability
Sort
View
WSC
2007
13 years 9 months ago
Requirements and design principles for multisimulation with multiresolution, multistage multimodels
The significance of simulation modeling at multiple levels, scales, and perspectives is well recognized. However, existing proposals for developing such models are often applicati...
Levent Yilmaz, Alvin Lim, Simon Bowen, Tuncer I. &...
CEC
2005
IEEE
13 years 9 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
ECLIPSE
2005
ACM
13 years 9 months ago
Building a whole-program type analysis in Eclipse
Eclipse has the potential to become a widely-used platform for implementation and dissemination of various static analyses for Java. In order to realize this potential, it is impo...
Mariana Sharp, Jason Sawin, Atanas Rountev
ISIM
2007
13 years 8 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 8 months ago
On stars and Steiner stars
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
Adrian Dumitrescu, Csaba D. Tóth