Sciweavers

38 search results - page 3 / 8
» Extremal graphs for the identifying code problem
Sort
View
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
13 years 11 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
DAC
2001
ACM
14 years 8 months ago
Watermarking Graph Partitioning Solutions
Trends in the semiconductor industry towards extensive design and code reuse motivate a need for adequate Intellectual Property Protection (IPP) schemes. We offer a new general IP...
Gregory Wolfe, Jennifer L. Wong, Miodrag Potkonjak
INFSOF
2002
153views more  INFSOF 2002»
13 years 7 months ago
Analyzing cloning evolution in the Linux kernel
Identifying code duplication in large multi-platform software systems is a challenging problem. This is due to a variety of reasons including the presence of high-level programmin...
Giuliano Antoniol, Umberto Villano, Ettore Merlo, ...
GECCO
2003
Springer
14 years 17 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
PODS
2004
ACM
96views Database» more  PODS 2004»
14 years 7 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...