Sciweavers

495 search results - page 11 / 99
» Adaptive Triangular System Solving
Sort
View
CADE
2007
Springer
15 years 10 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
ICCBR
2005
Springer
15 years 3 months ago
Case Adaptation by Segment Replanning for Case-Based Planning Systems
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
Flavio Tonidandel, Marcio Rillo
RC
2002
100views more  RC 2002»
14 years 9 months ago
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving systems of linear constrai...
Chong-Kan Chiu, Jimmy Ho-Man Lee
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
14 years 10 months ago
Metaheuristics for solving a real-world frequency assignment problem in GSM networks
The Frequency Assignment Problem (FAP) is one of the key issues in the design of GSM networks (Global System for Mobile communications), and will remain important in the foreseeab...
Francisco Luna, César Estébanez, Cor...
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 3 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert