Sciweavers

6142 search results - page 473 / 1229
» The Complexity of Partition Functions
Sort
View
199
Voted
COLING
1990
15 years 8 months ago
A Formal Description of Arabic Syntax in Definite Clause Grammar
Arabic has some special syntax features which lead to complex syntax structures. We have developed a formal description of Arabic syntax in Definite Clause Grammar. This grarnrnar...
Hisham El-Shishiny
APPML
2010
133views more  APPML 2010»
15 years 7 months ago
Fractional relaxation equations on Banach spaces
Abstract. We study existence and qualitative properties of solutions for the abstract fractional relaxation equation (0.1) u (t) - AD t u(t) + u(t) = f(t), 0 < < 1, t 0, u(...
Carlos Lizama, Humberto Prado
DAM
2008
61views more  DAM 2008»
15 years 7 months ago
Scheduling malleable tasks with interdependent processing rates: Comments and observations
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
Edmund K. Burke, Moshe Dror, James B. Orlin
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 6 months ago
Self-organizing maps and symbolic data
Abstract. In data analysis new forms of complex data have to be considered like for example (symbolic data, functional data, web data, trees, SQL query and multimedia data,. . . )....
Aïcha El Golli, Brieuc Conan-Guez, Fabrice Ro...
176
Voted
ECCC
2000
75views more  ECCC 2000»
15 years 6 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib