4218 search results - page 513 / 844 » Complete sets of cooperations |
157
click to vote
IJCAI
2007
15 years 6 months ago
2007
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
138
click to vote
IPCO
2007
15 years 6 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
156
Voted
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
148
Voted
FLAIRS
2004
15 years 6 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
141
click to vote
HIS
2004
15 years 6 months ago
2004
With inspiration from psychophysical researches of the human visual system we propose a novel method for performance evaluation of contour based shape recognition algorithms. We u...