1963 search results - page 248 / 393 » The Maximum Solution Problem on Graphs |
124
Voted
IAT
2009
IEEE
15 years 7 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
107
click to vote
EUROGP
2007
Springer
15 years 7 months ago
2007
Springer
This paper reports on the results of a preliminary study conducted to evaluate genetic programming (GP) as a means of evolving finite state transducers. A genetic programming syste...
111
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
108
Voted
EUROGP
2004
Springer
15 years 6 months ago
2004
Springer
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
102
click to vote
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...