1092 search results - page 95 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
146
click to vote
JAIR
2010
15 years 4 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
179
click to vote
INFOCOM
2007
IEEE
16 years 10 days ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
159
click to vote
IJAR
2010
15 years 4 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
170
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
166
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...