Sciweavers

9842 search results - page 1374 / 1969
» Problem complexity
Sort
View
GIS
2008
ACM
15 years 8 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans
JAIR
2000
105views more  JAIR 2000»
15 years 7 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber
224
Voted
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 5 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
MOBIHOC
2012
ACM
13 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
« Prev « First page 1374 / 1969 Last » Next »