2485 search results - page 363 / 497 » Time Bounded Frequency Computations |
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
ICS
1999
Tsinghua U.
14 years 8 days ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...
IJFCS
2006
13 years 8 months ago
2006
We continue here the study of the recently introduced spiking neural P systems, which mimic the way that neurons communicate with each other by means of short electrical impulses, ...
KI
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Assisted living means providing the assisted with custom services, specific to their needs and capabilities. Computer monitoring can supply some of these services, be it ...