Sciweavers

2343 search results - page 46 / 469
» Visual-Concept Search Solved
Sort
View
CADE
2007
Springer
16 years 1 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
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 7 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
168
Voted
BICOB
2010
Springer
15 years 5 months ago
A Grid-Enabled Problem Solving Environment for QTL Analysis in R
We present a grid-enabled problem solving environment (PSE), for multidimensional QTL analysis. The concept of a computational grid has not been fully realized within this and oth...
Mahen Jayawardena, Carl Nettelblad, Salman Zubair ...
AIPS
2010
15 years 2 months ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...
99
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 11 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise