Sciweavers

Share
COCOON
2009
Springer
8 years 9 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
COCOON
2009
Springer
9 years 29 days ago
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
We investigate the question whether NE can be separated from the reduction closures of tally sets, sparse sets and NP. We show that (1) NE RNP no(1)-T (TALLY); (2)NE RSN m (SPARS...
Bin Fu, Angsheng Li, Liyu Zhang
COCOON
2009
Springer
9 years 3 months ago
Three New Algorithms for Regular Language Enumeration
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
Margareta Ackerman, Erkki Mäkinen
COCOON
2009
Springer
9 years 3 months ago
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
Rastislav Srámek, Bernd Fischer, Elias Vica...
COCOON
2009
Springer
9 years 6 months ago
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
COCOON
2009
Springer
9 years 6 months ago
Computing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
Sebastian Böcker, Quang Bao Anh Bui, Patrick ...
COCOON
2009
Springer
9 years 6 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...
COCOON
2009
Springer
9 years 6 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
COCOON
2009
Springer
9 years 6 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...
books