16666 search results - page 89 / 3334 » Descriptive and Computational Complexity |
119
Voted
ICRA
2005
IEEE
15 years 9 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...
144
Voted
GRID
2005
Springer
15 years 9 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 ...
150
Voted
AAAI
2007
15 years 6 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...
105
click to vote
IANDC
2010
15 years 2 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 ...
119
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...