271 search results - page 36 / 55 » On the Online Unit Clustering Problem |
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
IVA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. While interactive virtual humans are becoming widely used in education, training and therapeutic applications, building animations which are both realistic and parameteri...
HOTOS
1993
IEEE
14 years 1 months ago
1993
IEEE
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA , that exploi...