Search Sciweavers | Sciweavers

2944 search results - page 40 / 589

» Improving Bound Propagation

105

click to vote

JAL
2006

89views more JAL 2006»

Improved bounds for the unsplittable flow problem

14 years 11 months ago

Download kam.mff.cuni.cz

In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...

Petr Kolman, Christian Scheideler

claim paper

Read More »

click to vote

JCT
2006

68views more JCT 2006»

An improved bound for the monochromatic cycle partition number

14 years 11 months ago

Download web.cs.wpi.edu

András Gyárfás, Miklós...

claim paper

Read More »

click to vote

TALG
2008

74views more TALG 2008»

Improved bounds for scheduling conflicting jobs with minsum criteria

14 years 11 months ago

Download www.ru.is

Rajiv Gandhi, Magnús M. Halldórsson,...

claim paper

Read More »

click to vote

TCAD
2008

66views more TCAD 2008»

Mining Global Constraints With Domain Knowledge for Improving Bounded Sequential Equivalence Checking

14 years 11 months ago

Download www.cesca.centers.vt.edu

Weixin Wu, Michael S. Hsiao

claim paper

Read More »

click to vote

COMBINATORICS
2004

61views more COMBINATORICS 2004»

Improved Bounds on the Length of Maximal Abelian Square-free Words

14 years 11 months ago

Download www.combinatorics.org

A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...

Evan M. Bullock

claim paper

Read More »

« Prev « First page 40 / 589 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers