5451 search results - page 701 / 1091 » Typed Operational Semantics |
174
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
233
click to vote
CBMS
2002
IEEE
15 years 11 months ago
2002
IEEE
The need for systems that can stock, represent, and provide efficient retrieval facilities of images of particular interest is becoming very high in medicine. In this respect, a l...
202
click to vote
LCPC
2009
Springer
15 years 11 months ago
2009
Springer
PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availabili...
190
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
169
click to vote
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...