2944 search results - page 356 / 589 » On Well Quasi-orders on Languages |
161
click to vote
ICTAI
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper presents a methodology for the real-time extraction of readers’ emotional state from documents as well as the representation of emotionally annotated documents into a...
159
click to vote
IEEECIT
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper proposes a new visual modeling environment for embedded component systems that improves the productivity of application developers. This embedded component system decre...
143
click to vote
LICS
2007
IEEE
16 years 27 days ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
195
click to vote
TIME
2007
IEEE
16 years 27 days ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
162
click to vote
WCRE
2007
IEEE
16 years 26 days ago
2007
IEEE
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...