4103 search results - page 64 / 821 » Some results on the Collatz problem |
HEURISTICS
2007
14 years 11 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
114
click to vote
HYBRID
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
ESA
2007
Springer
15 years 6 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
105
click to vote
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...