672 search results - page 4 / 135 » A General Solution to the Graph History Interaction Problem |
92
Voted
DAC
2001
ACM
15 years 11 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
15 years 4 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...
70
Voted
GECCO
2007
Springer
15 years 4 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...
90
Voted
WIDM
2006
ACM
15 years 4 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...
82
Voted
ARSCOM
2007
14 years 10 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...