Sciweavers

4103 search results - page 242 / 821
» Some results on the Collatz problem
Sort
View
ICFCA
2010
Springer
16 years 1 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 1 months ago
Extending Argumentation to Make Good Decisions
Abstract. Argumentation has been acknowledged as a powerful mechanism for automated decision making. In this context several recent works have studied the problem of accommodating ...
Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud
ICDCSW
2008
IEEE
16 years 1 months ago
Mobility Control for Complete Coverage in Wireless Sensor Networks
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
Zhen Jiang, Jie Wu, Robert Kline, Jennifer Krantz
PIMRC
2008
IEEE
16 years 1 months ago
A hierarchical structure based coverage repair in wireless sensor networks
—In this paper, we propose a new control method to cover “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are dis...
Jie Wu, Zhen Jiang
DEXAW
2007
IEEE
118views Database» more  DEXAW 2007»
16 years 1 months ago
Author Identification Using Imbalanced and Limited Training Texts
This paper deals with the problem of author identification. The Common N-Grams (CNG) method [6] is a language-independent profile-based approach with good results in many author i...
Efstathios Stamatatos