28888 search results - page 5394 / 5778 » Computability and complexity in analysis |
155
click to vote
AAAI
1996
15 years 6 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
146
click to vote
NIPS
1993
15 years 6 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
204
click to vote
BTW
2009
Springer
15 years 5 months ago
2009
Springer
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
160
click to vote
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
134
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...