46 search results - page 7 / 10 » The cost of getting local monotonicity |
169
click to vote
AAMAS
2004
Springer
15 years 6 months ago
2004
Springer
We present a multi-dimensional, multi-step negotiation mechanism for task allocation among cooperative agents based on distributed search. This mechanism uses marginal utility gai...
158
click to vote
JCIT
2010
15 years 1 months ago
2010
For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this ...
184
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
179
click to vote
TROB
2002
15 years 6 months ago
2002
Abstract-We describe Localization-Space Trails (LOST), a method that enables a team of robots to navigate between places of interest in an initially unknown environment using a tra...
171
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper we propose a new information-theoretic divisive algorithm for word clustering applied to text classification. In previous work, such "distributional clustering&...