1701 search results - page 171 / 341 » Computer Science and State Machines |
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
ENC
2006
IEEE
15 years 4 months ago
2006
IEEE
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discri...
106
click to vote
DFT
2003
IEEE
15 years 4 months ago
2003
IEEE
We discuss the use of convolutional codes to perform concurrent error detection (CED) in finite state machines (FSMs). We examine a previously proposed methodology, we identify i...