4009 search results - page 704 / 802 » Clustering on Complex Graphs |
137
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
130
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
137
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
150
click to vote
ICIC
2009
Springer
15 years 11 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
136
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...