3454 search results - page 460 / 691 » Modern computer algebra |
134
click to vote
CCA
2005
Springer
15 years 11 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
203
click to vote
DALT
2005
Springer
15 years 11 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
174
click to vote
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The under...
150
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
210
click to vote
BIRTHDAY
2004
Springer
15 years 11 months ago
2004
Springer
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...