Sciweavers

139 search results - page 25 / 28
» The graph Voronoi diagram with applications
Sort
View
APN
2004
Springer
15 years 2 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
APCCM
2009
14 years 10 months ago
Extracting Conceptual Graphs from Japanese Documents for Software Requirements Modeling
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...
Ryo Hasegawa, Motohiro Kitamura, Haruhiko Kaiya, M...
APVIS
2001
14 years 10 months ago
Information Visualization of Attributed Relational Data
Traditional graph drawing is only concerned with viewing of data and relations amount data items. It uses a graph model to present the data items and the relations and tries to ca...
Mao Lin Huang
ISIM
2007
14 years 11 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
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 2 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki