1740 search results - page 208 / 348 » A Digital Archive of Research Papers in Computer Science |
194
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
173
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
153
click to vote
BALT
2006
15 years 10 months ago
2006
In philosophy, the term ontology has been used since the 17th century to refer both to a philosophical discipline (Ontology with a capital "O"), and as a domain-independe...
185
click to vote
SWAT
1998
Springer
15 years 10 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
154
click to vote
MM
2005
ACM
16 years 17 hour ago
2005
ACM
With the growth of digital music, the development of music recommendation is helpful for users. The existing recommendation approaches are based on the users’ preference on musi...