8824 search results - page 227 / 1765 » On the Complexity of Real Functions |
196
click to vote
IJCGA
2010
15 years 5 months 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 ...
159
click to vote
ISORC
2008
IEEE
16 years 29 days ago
2008
IEEE
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...
148
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
131
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The issue of multiuser cooperation in a complexity constrained noise-free CDMA channel is addressed. Multiuser cooperation is imperative if conventional demodulation is expected to...