6568 search results - page 301 / 1314 » Reducing the Complexity of Reductions |
199
click to vote
AAAI
1997
15 years 8 months ago
1997
Difficult real-time AI problems require a means for expressing multi-dimensional and dynamic goal criteria and a principled model for satisficing to best meet the criteria. In the...
201
click to vote
ECCTD
2011
14 years 6 months ago
2011
Abstract—In this paper, a low complexity algorithm for the design of a time-varying correction filter of finite impulse response (FIR) type is presented. Using the obtained fi...
156
click to vote
STACS
2007
Springer
16 years 28 days ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
174
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
This essay draws on participant observation, ethnographic interviews, phenomenological inquiry, and recent insights from the study of swarm intelligence and complex networks to ill...
150
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...