14548 search results - page 2489 / 2910 » The Optimal Path-Matching Problem |
169
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...
173
click to vote
ICALP
2004
Springer
16 years 6 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
177
click to vote
ILP
2004
Springer
16 years 6 days ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
180
Voted
VLDB
2004
ACM
16 years 5 days ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
224
click to vote
FOCS
2003
IEEE
16 years 3 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...