1486 search results - page 200 / 298 » Algorithms for two-box covering |
140
click to vote
INFOCOM
1994
IEEE
15 years 8 months ago
1994
IEEE
A new model of nonuniform traffic is introduced for a single-hop packet-switching system. This traffic model allows arbitrary traffic streams subject only to a constraint on the nu...
133
Voted
ESA
2006
Springer
15 years 8 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
128
Voted
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
136
Voted
IFIP12
2007
15 years 6 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
150
click to vote
ICWS
2004
IEEE
15 years 6 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...