976 search results - page 41 / 196 » The Complexity of Timetable Construction Problems |
CORR
2009
Springer
13 years 6 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
STOC
1996
ACM
14 years 20 days ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
ECML
1993
Springer
14 years 18 days ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...