Sciweavers

321 search results - page 6 / 65

» Partitioning by iterative deletion

12

AAAI
2008

89views Intelligent Agents» more AAAI 2008»

Partitioned External-Memory Value Iteration

13 years 11 months ago

Partitioned External-Memory Value Iteration

Download www.cs.washington.edu

Peng Dai, Mausam, Daniel S. Weld

claim paper

Read More »

16

TODAES
2002

89views more TODAES 2002»

Cluster-aware iterative improvement techniques for partitioning large VLSI circuits

13 years 8 months ago

Cluster-aware iterative improvement techniques for partitioning large VLSI circuits

Download eref.uqu.edu.sa

Shantanu Dutt, Wenyong Deng

claim paper

Read More »

22

TECS
2010

63views more TECS 2010»

Iterational retiming with partitioning: Loop scheduling with complete memory latency hiding

13 years 7 months ago

Iterational retiming with partitioning: Loop scheduling with complete memory latency hiding

Download www.utdallas.edu

Chun Jason Xue, Jingtong Hu, Zili Shao, Edwin Hsin...

claim paper

Read More »

30

COCOON
2006
Springer

93views Combinatorics» more COCOON 2006»

Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size

13 years 11 months ago

Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size

Download www.nishizeki.ecei.tohoku.ac.jp

Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...

Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishiz...

claim paper

Read More »

25

JGT
2006

70views more JGT 2006»

Vertex partitions of chordal graphs

13 years 9 months ago

Vertex partitions of chordal graphs

Download www.ms.unimelb.edu.au

Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...

David R. Wood

claim paper

Read More »

« Prev « First page 6 / 65 Last » Next »