9842 search results - page 1892 / 1969 » The Complexity of the Matching-Cut Problem |
ICRA
2002
IEEE
14 years 19 days ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
IEEEINTERACT
2002
IEEE
14 years 19 days ago
2002
IEEE
A dynamic optimizer is a software-based system that performs code modifications at runtime, and several such systems have been proposed over the past several years. These systems ...
ISCA
2002
IEEE
14 years 19 days ago
2002
IEEE
Many emerging processor microarchitectures seek to manage technological constraints (e.g., wire delay, power, and circuit complexity) by resorting to nonuniform designs that provi...
STOC
2010
ACM
14 years 16 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
SIGECOM
2010
ACM
14 years 15 days ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...