1964 search results - page 55 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
ICALP
2010
Springer
14 years 17 days ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
WOWMOM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years, mobile elements (MEs) have been proposed as mechanical carriers of data to prolong the lifetime of sensor networks and to overcome network partitioning problem. A...