4860 search results - page 465 / 972 » SNPs Problems, Complexity, and Algorithms |
135
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
122
Voted
ICFCA
2007
Springer
15 years 10 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...
136
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- Evolutionary Algorithms (EAs) have the tendency to converge quickly into a single solution in the search space. However, many complex search problems require the identi...
146
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
135
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
The design of high performance multimedia systems in a short time force us to use IP's blocks in many designs. However, their correct integration in a design implies more com...