7106 search results - page 272 / 1422 » Restricted Complexity, General Complexity |
140
click to vote
PRL
2008
15 years 4 months ago
2008
In this paper, we propose spam e-mail filtering methods having high accuracies and low time complexities. The methods are based on the n-gram approach and a heuristics which is re...
100
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
126
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
133
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
119
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...