Sciweavers

1705 search results - page 221 / 341
» Representing Constraints with Automata
Sort
View
PARMA
2004
114views Database» more  PARMA 2004»
15 years 7 months ago
PatManQL: A Language to Manipulate Patterns and Data in Hierarchical Catalogs
Hierarchical structures and catalogs is a way to organize and enrich semantically the available information in the Web. From simple tree-like structures with syntactic constraints ...
Panagiotis Bouros, Theodore Dalamagas, Timos K. Se...
AAAI
1998
15 years 7 months ago
Abductive Planning with Sensing
In abductive planning, plans are constructed as reasons for an agent to act: plans are demonstrations in logical theory of action that a goal will result assuming that given actio...
Matthew Stone
WCET
2003
15 years 7 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
WSC
1998
15 years 7 months ago
Belief Networks in Construction Simulation
A method for automatically improving the performance of construction operations was developed by the integration of computer simulation and belief networks. The simulation model i...
Brenda McCabe
AAAI
1990
15 years 7 months ago
Understanding Natural Language with Diagrams
We describe a program, BEATRIX, that can understand textbook physics problems specified by a combination of English text and a diagram. The result of the understanding process is ...
Gordon S. Novak, William C. Bulko