Sciweavers

716 search results - page 23 / 144
» Modelling Bounded Rationality Using Evolutionary Techniques
Sort
View
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 9 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
FOSSACS
2005
Springer
14 years 2 months ago
A Computational Model for Multi-variable Differential Calculus
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Abbas Edalat, André Lieutier, Dirk Pattinso...
DSRT
2008
IEEE
14 years 3 months ago
Design of Application-Specific Incentives in P2P Networks
A rational P2P node may decide not to provide a particular resource or to provide it with degraded quality. If nodes are very likely to behave this way, or if the failure of an P2...
Andrew Roczniak, Abdulmotaleb El-Saddik, Ross Kouh...
FORTE
2008
13 years 10 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...
TABLEAUX
2007
Springer
14 years 3 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...