198 search results - page 19 / 40 » Reachability on prefix-recognizable graphs |
AAAI
2010
13 years 11 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
AIPS
2004
13 years 11 months ago
2004
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
CN
2006
13 years 10 months ago
2006
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
ICDE
2012
IEEE
12 years 8 days ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
TACAS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...