592 search results - page 36 / 119 » Learning Generalized Plans Using Abstract Counting |
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
ATMOS
2007
13 years 10 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
CONEXT
2006
ACM
14 years 2 months ago
2006
ACM
Accurate network traffic classification is an important task. We intend to develop an intelligent classification system by learning the types of service inside a network flow usin...
FLAIRS
2009
13 years 6 months ago
2009
The predicates that are used to encode a planning domain in PDDL often do not include concepts that are important for effectively reasoning about problems in the domain. In partic...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...