1598 search results - page 195 / 320 » A Unified Computation Model for Functional and Logic Program... |
151
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
176
click to vote
ISVC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
165
click to vote
ICALP
2007
Springer
16 years 15 days ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
183
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
160
click to vote
TCIAIG
2010
15 years 1 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...