2657 search results - page 39 / 532 » On the complexity of hierarchical problem solving |
115
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
121
click to vote
SCVMA
2004
Springer
15 years 6 months ago
2004
Springer
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
131
click to vote
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. A key problem in designing artificial neural networks for visual object recognition tasks is the proper choice of the network architecture. Evolutionary optimization met...
116
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
This paper concerns the management of energy in data centers using a cyber-physical model that supports the coordinated control of both computational and thermal (cooling) resource...
114
click to vote
AI
2003
Springer
15 years 6 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...