5022 search results - page 326 / 1005 » Data structures and problem solving using Java |
133
click to vote
IV
2009
IEEE
15 years 10 months ago
2009
IEEE
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
112
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
147
Voted
AMEC
2003
Springer
15 years 8 months ago
2003
Springer
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...
122
click to vote
CCCG
2008
15 years 4 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
AUTOMATICA
2007
15 years 3 months ago
2007
: In this paper we address the problem of detecting and isolating faults from noisy input/output measurements of a MIMO uncertain–system, subject to structured dynamic uncertaint...