Sciweavers

1021 search results - page 65 / 205
» Concepts in Proof Planning
Sort
View
ICWE
2010
Springer
13 years 7 months ago
Model-Driven Web Engineering Performance Prediction with Layered Queue Networks
This position paper describes an approach to predict the performances of a Web application already in the early stages of application development. It leverages the wealth of inform...
Alessio Gambi, Giovanni Toffetti, Sara Comai
KI
2010
Springer
13 years 6 months ago
Towards Opportunistic Action Selection in Human-Robot Cooperation
A robot that is to assist humans in everyday activities should not only be efficient, but also choose actions that are understandable for a person. One characteristic of human task...
Thibault Kruse, Alexandra Kirsch
AIMSA
2008
Springer
14 years 3 months ago
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by rea...
Roman Barták, Ondrej Cepek
COMPGEOM
1995
ACM
14 years 9 days ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
AAAI
1997
13 years 10 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag