4797 search results - page 127 / 960 » The complexity of partition tasks |
MVA
2007
13 years 11 months ago
2007
Service robots need object recognition strategy that can work on various objects in complex backgrounds. Since no single method can work in every situation, we need to combine sev...
INFORMATICALT
2007
13 years 10 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
TROB
2010
13 years 5 months ago
2010
Abstract--Acquisition of new sensorimotor knowledge by imitation is a promising paradigm for robot learning. To be effective, action learning should not be limited to direct replic...
ISCA
2003
IEEE
14 years 3 months ago
2003
IEEE
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
DAC
2008
ACM
14 years 11 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...