Sciweavers

5889 search results - page 188 / 1178
» Graph Layout Problems
Sort
View
164
Voted
ICSE
2001
IEEE-ACM
15 years 10 months ago
A Scalable Formal Method for Design and Automatic Checking of User Interfaces
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Rous...
SOFTVIS
2010
ACM
15 years 6 months ago
Embedding spatial software visualization in the IDE: an exploratory study
Software visualization can be of great use for understanding and exploring a software system in an intuitive manner. Spatial representation of software is a promising approach of ...
Adrian Kuhn, David Erni, Oscar Nierstrasz
GECCO
2009
Springer
15 years 11 months ago
The sensitivity of HyperNEAT to different geometric representations of a problem
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
Jeff Clune, Charles Ofria, Robert T. Pennock
ANOR
2010
112views more  ANOR 2010»
15 years 6 months ago
The Multi-Story Space Assignment Problem
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
Peter M. Hahn, J. MacGregor Smith, Yi-Rong Zhu
FCT
2009
Springer
15 years 10 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner