3897 search results - page 98 / 780 » complexity 2010 |
122
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The study of the sub-structure of complex networks is of major importance to relate topology and functionality. Many efforts have been devoted to the analysis of the modular struc...
119
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
146
click to vote
IJCGA
2010
15 years 27 days ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
101
click to vote
PC
2010
15 years 25 days ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...
133
Voted
SAGT
2010
Springer
15 years 24 days ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...