1697 search results - page 292 / 340 » On Bayesian Case Matching |
IPL
2007
13 years 8 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
CCE
2005
13 years 7 months ago
2005
In this paper, a rigorous MILP formulation for grass-root design of heat exchanger networks is developed. The methodology does not rely on traditional supertargeting followed by n...
COMBINATORICS
2002
13 years 7 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
ENTCS
2000
13 years 7 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
AI
1999
Springer
13 years 7 months ago
1999
Springer
While terminology and some concepts of behavior-based robotics have become widespread, the central ideas are often lost as researchers try to scale behavior to higher levels of co...