Sciweavers

489 search results - page 36 / 98
» Support tools for graphs in computer science
Sort
View
JGAA
2006
108views more  JGAA 2006»
15 years 1 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
HICSS
2007
IEEE
109views Biometrics» more  HICSS 2007»
15 years 7 months ago
Towards Reliable Computation of Large-Scale Market-Based Optimal Power Flow
The deregulated electricity market calls for robust OPF tools that can provide (a) deterministic convergence, (b) accurate computation of a variety of nodal prices, (c) support of...
Hongye Wang, Robert J. Thomas
BIRTHDAY
2010
Springer
15 years 2 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
CAISE
2000
Springer
15 years 5 months ago
An Overview of RoZ: A Tool for Integrating UML and Z Specifications
This paper presents an approach and a tool to increase specification quality by using a combination of UML and formal languages. Our approach is based on the expression of the UML ...
Sophie Dupuy, Yves Ledru, Monique Chabre-Peccoud
DSD
2003
IEEE
138views Hardware» more  DSD 2003»
15 years 6 months ago
A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture
Network on Chip (NoC) is a new paradigm for designing core based System on Chip which supports high degree of reusability and is scalable. In this paper we describe an efficient t...
Tang Lei, Shashi Kumar