27 search results - page 3 / 6 » cl 2008 |
ITA
2008
13 years 4 months ago
2008
A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.
CL
2008
Springer
13 years 4 months ago
2008
Springer
Component-orientedprogramming(COP)isactuallyakeyresearchtrackinsoftwareengineering.Avarietyofcomponent-oriented s (COLs) have been proposed with new or adapted abstractions and me...
CL
2008
Springer
13 years 4 months ago
2008
Springer
Dynamic, unanticipated adaptation of running systems is of interest in a variety of situations, ranging from functional upgrades to on-the-fly debugging or monitoring of critical ...
JSCIC
2008
13 years 4 months ago
2008
In this work we consider a new class of Relaxation Finite Element schemes for Conservation Laws, with more stable behavior on the limit area of the relaxation parameter. Combine t...
CPC
2002
13 years 4 months ago
2002
Let (G) be the largest eigenvalue of the adjacency matrix of a graph G: We show that if G is Kp+1-free then (G) r 2 p 1 p e (G): This inequality was ...rst conjectured by Edwards ...