760 search results - page 94 / 152 » Algorithms for finding clique-transversals of graphs |
147
click to vote
ALENEX
2010
15 years 7 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
165
click to vote
BNCOD
2004
15 years 7 months ago
2004
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
164
Voted
ENDM
2010
15 years 5 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
136
click to vote
KI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...
169
click to vote
NETWORKS
2008
15 years 5 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...