472 search results - page 81 / 95 » Limiting Negations in Formulas |
STACS
2005
Springer
14 years 4 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
LAWEB
2003
IEEE
14 years 3 months ago
2003
IEEE
Streaming media applications are becoming more popular on the late years, as for example, news transmitted live through the web, music, show, and films. Traditional client/server...
SIGMOD
1996
ACM
14 years 2 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge...
AAAI
2006
14 years 1 days ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...