Sciweavers

731 search results - page 121 / 147
» Reductions to Graph Isomorphism
Sort
View
FCCM
2008
IEEE
176views VLSI» more  FCCM 2008»
13 years 9 months ago
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
Shannon Koh, Oliver Diessel
ENTCS
2008
123views more  ENTCS 2008»
13 years 9 months ago
A Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
Johannes Borgström, Andrew D. Gordon, Andrew ...
DEDS
2006
111views more  DEDS 2006»
13 years 9 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
TIT
2008
122views more  TIT 2008»
13 years 8 months ago
Identifying Codes and Covering Problems
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
Moshe Laifenfeld, Ari Trachtenberg
JCO
1998
136views more  JCO 1998»
13 years 8 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...