994 search results - page 20 / 199 » Custom Computing Machines for the Set Covering Problem |
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Book
"This book is intended to be an intellectual journey into the domain of human and machine intelligence". The book covers several topics such as intelligence, knowledge re...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
AAAI
2006
13 years 9 months ago
2006
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...