794 search results - page 23 / 159 » Improved algorithms for orienteering and related problems |
174
click to vote
IWOCA
2009
Springer
16 years 16 days ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
155
click to vote
FLAIRS
2000
15 years 7 months ago
2000
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
140
click to vote
NCA
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a new algorithm for a reconfigurable distributed domain-oriented atomic object service, called DO-RAMBO, which stands for Domain-Oriented Reconfigurable Atom...
142
click to vote
IDA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
150
click to vote
CONSTRAINTS
1999
15 years 5 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...