16666 search results - page 93 / 3334 » Descriptive and Computational Complexity |
150
Voted
TARK
2009
Springer
15 years 10 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
141
click to vote
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
109
click to vote
IEAAIE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
102
click to vote
IJCAI
1997
15 years 5 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
121
Voted
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...