172 search results - page 23 / 35 » The Complexity of Unions of Disjoint Sets |
124
Voted
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
127
click to vote
AISC
2010
Springer
15 years 6 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
111
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
150
Voted
DSN
2000
IEEE
15 years 6 months ago
2000
IEEE
Multiple-Phased Systems, whose operational life can be partitioned in a set of disjoint periods, called “phases”, include several classes of systems such as Phased Mission Sys...
142
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...