9842 search results - page 1788 / 1969 » The Complexity of the Matching-Cut Problem |
157
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...
159
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— When the tasks of a mission are interrelated and subject to several resource constraints, more efforts are needed to coordinate robots towards achieving the mission than indepe...
128
click to vote
ISQED
2007
IEEE
15 years 10 months ago
2007
IEEE
In high-level synthesis for FPGA designs, scheduling and chaining of operations for optimal performance remain challenging problems. In this paper, we present a balanced schedulin...
127
click to vote
ISVLSI
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Time-to-Market plays a central role on System-ona-Chip (SoC) competitiveness and the quality of the final product is a matter of concern as well. As SoCs complexity in...
112
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Growth in the complexity of computing systems, in the dynamism of the environments they operate in, and the need for timely adaptations as conditions change, now pose significant...