Sciweavers

4865 search results - page 834 / 973
» The Complexity of Graph Connectivity
Sort
View
LICS
2008
IEEE
15 years 4 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
GD
2005
Springer
15 years 3 months ago
Network Analysis and Visualisation
A workshop on Network Analysis and Visualisation was held on September 11, 2005 in Limerick Ireland, in conjunction with 2005 Graph Drawing conference. This report review the backg...
Seok-Hee Hong
SG
2005
Springer
15 years 3 months ago
Multi-level Interaction in Parametric Design
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
Robert Aish, Robert Woodbury
ECCB
2002
IEEE
15 years 3 months ago
Stochastic roadmap simulation for the study of ligand-protein interactions
The dynamics of ligand-protein interactions are necessary to understand for the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simul...
Mehmet Serkan Apaydin, Carlos Guestrin, Chris Varm...