Sciweavers

4854 search results - page 969 / 971
» It's the Programming, Stupid
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
BMCBI
2004
123views more  BMCBI 2004»
13 years 9 months ago
A two-way interface between limited Systems Biology Markup Language and R
Background: Systems Biology Markup Language (SBML) is gaining broad usage as a standard for representing dynamical systems as data structures. The open source statistical programm...
Tomas Radivoyevitch
CN
2004
109views more  CN 2004»
13 years 9 months ago
Architectures and protocols for mobile computing applications: a reconfigurable approach
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
Carla-Fabiana Chiasserini, Francesca Cuomo, Leonar...
CORR
2004
Springer
208views Education» more  CORR 2004»
13 years 9 months ago
Business Intelligence from Web Usage Mining
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
Ajith Abraham
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 9 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard