Sciweavers

1237 search results - page 184 / 248
» Abstract shade trees
Sort
View
AIPS
1996
13 years 11 months ago
Least-Commitment Action Selection
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
Marc Friedman, Daniel S. Weld
ML
2006
ACM
13 years 10 months ago
XRules: An effective algorithm for structural classification of XML data
Abstract XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining ...
Mohammed Javeed Zaki, Charu C. Aggarwal
ICFP
2005
ACM
14 years 10 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
VMCAI
2010
Springer
14 years 7 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
COMPUTER
1998
131views more  COMPUTER 1998»
13 years 9 months ago
Windows NT Clustering Service
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
Rod Gamache, Rob Short, Mike Massa