Sciweavers

3145 search results - page 402 / 629
» Algebraic Linear Orderings
Sort
View
AI
2010
Springer
15 years 6 months ago
Double preference relations for generalised belief change
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...
JSCIC
2006
98views more  JSCIC 2006»
15 years 6 months ago
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...
Sigal Gottlieb, Steven J. Ruuth
TCAD
2008
106views more  TCAD 2008»
15 years 6 months ago
Track Routing and Optimization for Yield
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
JSCIC
2007
125views more  JSCIC 2007»
15 years 6 months ago
Discrete Fundamental Solution Preconditioning for Hyperbolic Systems of PDE
We present a new preconditioner for the iterative solution of linear systems of equations arising from discretizations of systems of first order partial differential equations (P...
Henrik Brandén, Sverker Holmgren, Per Sundq...
BMCBI
2004
125views more  BMCBI 2004»
15 years 6 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner