Sciweavers

3009 search results - page 349 / 602
» The Expressive Rate of Constraints
Sort
View
APAL
2004
78views more  APAL 2004»
15 years 6 months ago
Ternary relations and relevant semantics
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...
Robert K. Meyer
AI
1999
Springer
15 years 6 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
SP
2002
IEEE
128views Security Privacy» more  SP 2002»
15 years 6 months ago
Fitting hidden Markov models to psychological data
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...
Ingmar Visser, Maartje E. J. Raijmakers, Peter C. ...
TCAD
2002
73views more  TCAD 2002»
15 years 6 months ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
MSCS
2007
91views more  MSCS 2007»
15 years 6 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...