672 search results - page 4 / 135 » A General Solution to the Graph History Interaction Problem |
DAC
2001
ACM
14 years 8 months ago
2001
ACM
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...
AICT
2006
IEEE
14 years 1 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Recent studies on the support of engineers during conceptual design resulted in a non-traditional type of Multi-Objective Problems (MOPs), namely concept-based ones. In concept-ba...
WIDM
2006
ACM
14 years 1 months ago
2006
ACM
The preservation of digital artifacts represents an unanswered challenge for the modern information society: XML and its query languages provide an effective environment to addre...
ARSCOM
2007
13 years 7 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...