13306 search results - page 2346 / 2662 » Theoretical Computer Science |
193
click to vote
LICS
2003
IEEE
16 years 16 days ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
297
click to vote
LICS
2003
IEEE
16 years 16 days ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
200
click to vote
LICS
2003
IEEE
16 years 16 days ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
202
click to vote
LICS
2003
IEEE
16 years 16 days ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
204
click to vote
KCAP
2003
ACM
16 years 15 days ago
2003
ACM
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...