5595 search results - page 909 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
FCS
2008
15 years 7 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
185
click to vote
IMAMS
2007
15 years 7 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
169
Voted
AAAI
2004
15 years 7 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
171
click to vote
UAI
2004
15 years 7 months ago
2004
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
164
click to vote
WSC
2004
15 years 7 months ago
2004
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...