2100 search results - page 207 / 420 » Fundamentals of the problem |
144
Voted
ECML
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
131
click to vote
KDD
2003
ACM
16 years 1 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
91
Voted
MP
2006
15 years 20 days ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
128
Voted
ICCAD
1999
IEEE
15 years 5 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
120
Voted
SENSYS
2003
ACM
15 years 6 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...