1073 search results - page 125 / 215 » Formal Program Development with Approximations |
112
click to vote
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
124
click to vote
TOOLS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper reports on an effort to use both the system theoretic DEVS (discrete event simulation) formalism and the JavaBeans component model as a basis for a componentbased discr...
224
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
107
click to vote
PPDP
2005
Springer
15 years 7 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
128
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
In this paper we present an approach that evolves the consensus sequence [25] for multiple sequence alignment (MSA) with genetic algorithm (GA). We have developed an encoding schem...