Results 1  10
of
543,422
Set partitioning via inclusionexclusion
 SIAM J. Comput
"... Abstract. Given a set N with n elements and a family F of subsets, we show how to partition N into k such subsets in 2nnO(1) time. We also consider variations of this problem where the subsets may overlap or are weighted, and we solve the decision, counting, summation, and optimisation versions of t ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
of these problems. Our algorithms are based on the principle of inclusion–exclusion and the zeta transform. In effect we get exact algorithms in 2nnO(1) time for several wellstudied partition problems including Domatic Number, Chromatic Number, Maximum kCut, Bin Packing, List Colouring, and the Chromatic
Set MultiCovering via InclusionExclusion
"... Set multicovering is a generalization of the set covering problem where each element may need to be covered more than once and thus some subset in the given family of subsets may be picked several times for minimizing the number of sets to satisfy the coverage requirement. In this paper, we propose ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
propose a family of exact algorithms for the set multicovering problem based on the inclusionexclusion principle. The presented ESMC (Exact Set MultiCovering) algorithm takes * n O ((2 t) ) time and * n O ( ( t + 1) ) space where t is the maximum value in the coverage requirement set (The * O ( f ( n
InclusionExclusion Algorithms for Counting Set Partitions
, 2006
"... Given an nelement set U and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1) fo ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
Given an nelement set U and a family of subsets S ⊆ 2 U we show how to count the number of kpartitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2 n n O(1). The only assumption on S is that it can be enumerated in time 2 n n O(1). In effect we get exact algorithms in time 2 n n O(1
K.B.: MultiInterval Discretization of ContinuousValued Attributes for Classication Learning. In:
 IJCAI.
, 1993
"... Abstract Since most realworld applications of classification learning involve continuousvalued attributes, properly addressing the discretization process is an important problem. This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuousvalued a ..."
Abstract

Cited by 831 (7 self)
 Add to MetaCart
formally derive a criterion based on the minimum description length principle for deciding the partitioning of intervals. We demonstrate via empirical evaluation on several realworld data sets that better decision trees are obtained using the new multiinterval algorithm.
Architectural Styles and the Design of Networkbased Software Architectures
, 2000
"...
The World Wide Web has succeeded in large part because its software architecture has been designed to meet the needs of an Internetscale distributed hypermedia system. The Web has been iteratively developed over the past ten years through a series of modifications to the standards that define its ..."
Abstract

Cited by 1119 (1 self)
 Add to MetaCart
architecture. In order to identify those aspects of the Web that needed improvement and avoid undesirable modifications, a model for the modern Web architecture was needed to guide its design, definition, and deployment.
Software architecture research investigates methods for determining how best to partition
A message ferrying approach for data delivery in sparse mobile ad hoc networks
 In Proc. of ACM Mobihoc
, 2004
"... Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and selfconfiguring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions ..."
Abstract

Cited by 498 (14 self)
 Add to MetaCart
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and selfconfiguring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions
On the InclusionExclusion Principle
, 2000
"... We will be walking for some time where the InclusionExclusion Principle is leading us. ..."
Abstract
 Add to MetaCart
We will be walking for some time where the InclusionExclusion Principle is leading us.
Polyhedral InclusionExclusion
, 2004
"... Motivated by numerical computations to solve probabilistic constrained stochastic programming problems, we derive a new identity claiming that many terms are cancelled out in the inclusion–exclusion formula expressing the complement of a Euclidean polyhedron. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Motivated by numerical computations to solve probabilistic constrained stochastic programming problems, we derive a new identity claiming that many terms are cancelled out in the inclusion–exclusion formula expressing the complement of a Euclidean polyhedron.
InclusionExclusion for kCNF Formulas
 Inf. Process. Lett
, 2002
"... We show that the number of satisfying assignments of a kCNF formula is determined uniquely from the numbers of unsatisfying assignments for clausesets of size up to k#+ 2. The information of this size is also shown to be necessary. key words: combinatorial problems; SAT; kCNF formula; counting ..."
Results 1  10
of
543,422