10447 search results - page 1907 / 2090 » The Philosophy of Computer Science |
181
click to vote
ICS
2009
Tsinghua U.
16 years 29 days ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
169
click to vote
ATAL
2009
Springer
16 years 23 days ago
2009
Springer
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
156
click to vote
BTW
2009
Springer
16 years 23 days ago
2009
Springer
: TinTO is an experimental system aiming at demonstrating the usefulness and feasibility of incrementally evaluated SQL queries for analyzing a wide spectrum of data streams. As ap...
160
click to vote
FCT
2009
Springer
16 years 22 days ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
187
click to vote
FM
2009
Springer
16 years 22 days ago
2009
Springer
This position paper argues that the operational modelling approaches from the formal methods community can be applied fruitfully within the systems biology domain. The results can ...