Sciweavers

8647 search results - page 428 / 1730
» The Container Selection Problem
Sort
View
COCOON
2003
Springer
15 years 10 months ago
Petri Nets with Simple Circuits
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
Hsu-Chun Yen, Lien-Po Yu
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
15 years 9 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
CCCG
2008
15 years 6 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 6 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
JSAT
2008
90views more  JSAT 2008»
15 years 4 months ago
2006 and 2007 Max-SAT Evaluations: Contributed Instances
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as Max...
Federico Heras, Javier Larrosa, Simon de Givry, Th...