555 search results - page 79 / 111 » Decompositions of Grammar Constraints |
SIAMNUM
2010
13 years 3 months ago
2010
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
APCHI
1998
IEEE
14 years 23 days ago
1998
IEEE
In this paper, a visual system Eviss is proposed. Visual systems proposed so far have been fixed on certain specifications. It is hard to make and modify such visual systems. Sinc...
BMCBI
2005
13 years 8 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...