Sciweavers

2944 search results - page 516 / 589
» On Well Quasi-orders on Languages
Sort
View
ICALP
2010
Springer
14 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
ICALP
2010
Springer
14 years 2 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
CHARME
2001
Springer
133views Hardware» more  CHARME 2001»
14 years 2 months ago
View from the Fringe of the Fringe
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
Steven D. Johnson
ICALP
2001
Springer
14 years 2 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
IFIP
2001
Springer
14 years 2 months ago
Functional Test Generation using Constraint Logic Programming
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
Zhihong Zeng, Maciej J. Ciesielski, Bruno Rouzeyre