4110 search results - page 60 / 822 » Efficient algorithms for the 2-gathering problem |
127
Voted
CF
2006
ACM
15 years 9 months ago
2006
ACM
Regular distributions for storing dense matrices on parallel systems are not always used in practice. In many scientific applicati RUMMA) [1] to handle irregularly distributed mat...
118
click to vote
AMC
2004
15 years 3 months ago
2004
The present work investigates the efficiency of the multigrid numerical method when used to solve two-dimensional laminar velocity and temperature fields inside a rectangular doma...
141
click to vote
MST
2010
14 years 10 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
161
Voted
AAAI
1994
15 years 5 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
159
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...