17541 search results - page 96 / 3509 » Complexity in scalable computing |
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
109
click to vote
GRID
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
118
click to vote
AAAI
2007
15 years 2 months ago
2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
IANDC
2010
14 years 10 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
