1705 search results - page 274 / 341 » Representing Constraints with Automata |
117
Voted
ECP
1997
Springer
15 years 5 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
144
click to vote
ISSS
1996
IEEE
15 years 5 months ago
1996
IEEE
The application range of the embedded computing is going to cover the majority of the market products spanning from consumer electronic, automotive, telecom and process control. F...
106
Voted
KDD
1994
ACM
15 years 4 months ago
1994
ACM
Our research investigates howdomainsemantics are discovered froma relational database at a high level of automation. Thediscoveries are then represented as the extendedEntityRelat...
86
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
96
Voted
ACMICEC
2007
ACM
15 years 4 months ago
2007
ACM
Humans are "smart components" in a system, but cannot be directly programmed to perform; rather, their autonomy must be respected as a design constraint and incentives p...