Sciweavers

1977 search results - page 25 / 396
» The satisfactory partition problem
Sort
View
JAMDS
2002
63views more  JAMDS 2002»
15 years 5 months ago
Goodness-of-fit tests based on sample space partitions: a unifying overview
Abstract. Recently the authors have proposed tests for the one-sample and the ksample problem, and a test for independence. All three tests are based on sample space partitions, bu...
Olivier Thas, Jean-Pierre Ottoy
ICPP
2008
IEEE
16 years 6 days ago
Parallel Inferencing for OWL Knowledge Bases
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
Ramakrishna Soma, Viktor K. Prasanna
EOR
2006
57views more  EOR 2006»
15 years 5 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
IPCO
2010
152views Optimization» more  IPCO 2010»
15 years 7 months ago
Hypergraphic LP Relaxations for Steiner Trees
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K
Deeparnab Chakrabarty, Jochen Könemann, David...
DM
2007
63views more  DM 2007»
15 years 5 months ago
On Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
George E. Andrews, James A. Sellers