Sciweavers

8780 search results - page 391 / 1756
» On the Feasibility of Consistent Computations
Sort
View
ICCS
2005
Springer
16 years 1 months ago
Analysis of Discrete Adjoints for Upwind Numerical Schemes
Abstract. This paper discusses several aspects related to the consistency and stability of the discrete adjoints of upwind numerical schemes. First and third order upwind discretiz...
Zheng Liu, Adrian Sandu
SAMOS
2004
Springer
16 years 1 months ago
The Molen Programming Paradigm
— In this paper we present the Molen programming paradigm, which is a sequential consistency paradigm for programming Custom Computing Machines (CCM). The programming paradigm al...
Stamatis Vassiliadis, Georgi Gaydadjiev, Koen Bert...
ADC
2003
Springer
101views Database» more  ADC 2003»
16 years 28 days ago
Operational Semantics of Transactions
Mathematics is forcing towards a consistent framework of theory development. Computer Science is an engineering discipline and sometimes suffers from ad-hoc definitions. Transac...
Andreas Prinz, Bernhard Thalheim
ISPE
2003
15 years 9 months ago
Negotiation algorithms for collaborative design settings
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
Mark Klein, Peyman Faratin, Hiroki Sayama, Yaneer ...
NIPS
1998
15 years 9 months ago
Orientation, Scale, and Discontinuity as Emergent Properties of Illusory Contour Shape
A recent neural model of illusory contour formation is based on a distribution of natural shapes traced by particles moving with constant speed in directions given by Brownian mot...
Karvel K. Thornber, Lance R. Williams