Sciweavers

1767 search results - page 327 / 354
» Accessibility first!: a new approach to web design
Sort
View
CADE
2007
Springer
14 years 9 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
BMCBI
2010
141views more  BMCBI 2010»
13 years 8 months ago
BioPhysConnectoR: Connecting Sequence Information and Biophysical Models
Background: One of the most challenging aspects of biomolecular systems is the understanding of the coevolution in and among the molecule(s). A complete, theoretical picture of th...
Franziska Hoffgaard, Philipp Weil, Kay Hamacher
BMCBI
2010
130views more  BMCBI 2010»
13 years 8 months ago
Knowledge-guided gene ranking by coordinative component analysis
Background: In cancer, gene networks and pathways often exhibit dynamic behavior, particularly during the process of carcinogenesis. Thus, it is important to prioritize those gene...
Chen Wang, Jianhua Xuan, Huai Li, Yue Wang, Ming Z...
ICPP
1998
IEEE
14 years 27 days ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
FOSSACS
2005
Springer
14 years 2 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto