3471 search results - page 218 / 695 » Obstacle Numbers of Graphs |
112
Voted
MP
2002
15 years 4 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
136
click to vote
HPCA
2008
IEEE
16 years 5 months ago
2008
IEEE
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...
139
click to vote
PPAM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Memetic Algorithms are the most frequently used hybrid of Evolutionary Algorithms (EA) for real-world applications. This paper will deal with one of the most important ob...
150
click to vote
HRI
2006
ACM
15 years 11 months ago
2006
ACM
Polymorphic, or shape-shifting, robots can normally tackle more types of tasks than non-polymorphic robots due to their flexible morphology. Their versatility adds to the challeng...
148
click to vote
RSS
2007
15 years 6 months ago
2007
— Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. However, algorithms that find the optimal solution are usually computa...