Sciweavers

Share
COCOON
2005
Springer
9 years 3 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
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...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
COCOON
2005
Springer
9 years 3 months ago
Solovay Reducibility on D-c.e Real Numbers
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...
Robert Rettinger, Xizhong Zheng
COCOON
2005
Springer
9 years 3 months ago
On-Line Algorithms for Market Equilibria
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...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
COCOON
2005
Springer
9 years 3 months ago
On the Power of Lookahead in On-Line Vehicle Routing Problems
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.
Luca Allulli, Giorgio Ausiello, Luigi Laura
COCOON
2005
Springer
9 years 7 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
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...
Fabien Baille, Evripidis Bampis, Christian Lafores...
COCOON
2005
Springer
9 years 7 months ago
Genome Rearrangements with Partially Ordered Chromosomes
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 ...
Chunfang Zheng, David Sankoff
COCOON
2005
Springer
9 years 7 months ago
Promised and Distributed Quantum Search
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...
Shengyu Zhang
COCOON
2005
Springer
9 years 7 months ago
Construction of Scale-Free Networks with Partial Information
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...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
COCOON
2005
Springer
9 years 7 months ago
Some New Results on Inverse Sorting Problems
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...
Xiaoguang Yang, Jianzhong Zhang 0001
COCOON
2005
Springer
9 years 7 months ago
A Theoretical Upper Bound for IP-Based Floorplanning
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...
Guowu Yang, Xiaoyu Song, Hannah Honghua Yang, Fei ...
books