Sciweavers

1883 search results - page 26 / 377
» Ordered theta graphs
Sort
View
AIPS
2000
13 years 9 months ago
Distance-Based Goal-Ordering Heuristics for Graphplan
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
Subbarao Kambhampati, Romeo Sanchez Nigenda
ASPDAC
1995
ACM
66views Hardware» more  ASPDAC 1995»
13 years 11 months ago
Region definition and ordering assignment with the minimization of the number of switchboxes
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
Jin-Tai Yan
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz
ECML
1998
Springer
13 years 12 months ago
First-Order Learning for Web Mining
We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in ...
Mark Craven, Seán Slattery, Kamal Nigam
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber