Sciweavers

5473 search results - page 1004 / 1095
» On the graph isomorphism problem
Sort
View
APN
1995
Springer
15 years 4 months ago
Modular State Space Analysis of Coloured Petri Nets
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce ...
Søren Christensen, Laure Petrucci
EURODAC
1995
IEEE
202views VHDL» more  EURODAC 1995»
15 years 4 months ago
Hardware-software co-synthesis of fault-tolerant real-time distributed embedded systems
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
Santhanam Srinivasan, Niraj K. Jha
FPGA
1995
ACM
149views FPGA» more  FPGA 1995»
15 years 4 months ago
PathFinder: A Negotiation-based Performance-driven Router for FPGAs
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
Larry McMurchie, Carl Ebeling
LICS
1997
IEEE
15 years 4 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
130
Voted
UIST
1995
ACM
15 years 4 months ago
3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information
A fundamental issue in user interface design is the effective use of available screen space, commonly referred to as the screen real estate problem. This paper presents a new dist...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
« Prev « First page 1004 / 1095 Last » Next »