COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
d Abstract] Luca Allulli, Giorgio Ausiello, and Luigi Laura Dip. di Informatica e Sistemistica Universit`a di Roma “La Sapienza” Via Salaria, 113 - 00198 Roma Italy.
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
COCOON
2005
Springer
14 years 5 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
COCOON
2005
Springer
14 years 5 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
COCOON
2005
Springer
14 years 5 months ago
2005
Springer
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
COCOON
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
COCOON
2005
Springer
14 years 5 months ago
2005
Springer
Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules...