Sciweavers

194 search results - page 17 / 39
» Better polynomials for GNFS
Sort
View
TCOM
2008
81views more  TCOM 2008»
13 years 9 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
CP
2011
Springer
12 years 9 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
14 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
AAAI
2008
13 years 12 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
COCOON
2008
Springer
13 years 11 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang