Sciweavers

849 search results - page 32 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
MOR
2006
95views more  MOR 2006»
13 years 7 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 1 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
ADHOCNOW
2008
Springer
14 years 2 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
COMPSEC
2010
122views more  COMPSEC 2010»
13 years 6 months ago
Taming role mining complexity in RBAC
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
ICRA
2007
IEEE
115views Robotics» more  ICRA 2007»
14 years 2 months ago
Sensor Selection Using Information Complexity for Multi-sensor Mobile Robot Localization
—Our sensor selection algorithm targets the problem of global self-localization of multi-sensor mobile robots. The algorithm builds on the probabilistic reasoning using Bayes fil...
Sreenivas R. Sukumar, Hamparsum Bozdogan, David L....