789 search results - page 11 / 158 » Solving Complex Problems Efficiently with Adaptive Automata |
AIPS
2008
13 years 9 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
RC
2002
13 years 7 months ago
2002
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...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
ICALT
2010
IEEE
13 years 6 months ago
2010
IEEE
—Due to the difficulty and thus effort and expenses involved in creating them, personalization strategies in learning environments have to demonstrate a higher returnon-investmen...