1225 search results - page 136 / 245 » The Instance Complexity Conjecture |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
JAR
2006
13 years 9 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
TCAD
2008
13 years 9 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
TKDE
2008
13 years 9 months ago
2008
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
AROBOTS
2004
13 years 9 months ago
2004
We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are d...