1068 search results - page 41 / 214 » For completeness, sublogarithmic space is no space |
SIAMCOMP
2010
14 years 6 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
SOCIALCOM
2010
14 years 9 months ago
2010
: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...
118
click to vote
ICML
1994
IEEE
15 years 3 months ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
116
click to vote
EDBT
2011
ACM
14 years 3 months ago
2011
ACM
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...