Sciweavers

9730 search results - page 152 / 1946
» Relating models of backtracking
Sort
View
126
Voted
ECMDAFA
2009
Springer
81views Hardware» more  ECMDAFA 2009»
15 years 7 months ago
Enabling Automated Traceability Maintenance through the Upkeep of Traceability Relations
Abstract. Traceability is demanded within mature development processes and offers a wide range of advantages. Nevertheless, there are deterrents to establishing traceability: it c...
Patrick Mäder, Orlena Gotel, Ilka Philippow
128
Voted
IJCAI
2003
15 years 5 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 3 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney
138
Voted
IGPL
2000
103views more  IGPL 2000»
15 years 3 months ago
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
This paper has two goals. First, we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning....
Ofer Arieli, Arnon Avron
113
Voted
TIT
2011
119views more  TIT 2011»
14 years 10 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer