Sciweavers

1559 search results - page 129 / 312
» Some Group Theory Problems
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 1 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
168
Voted
DIALM
2000
ACM
112views Algorithms» more  DIALM 2000»
15 years 9 months ago
A decision-theoretic approach to resource allocation in wireless multimedia networks
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li, S...
CCE
2004
15 years 4 months ago
On the use of reduced order models in bifurcation analysis of distributed parameter systems
Bifurcation theory provides a powerful tool for analyzing the nonlinear dynamic behavior of process systems. However, although the theory in principle applies to lumped as well as...
Yi Liu, Elling W. Jacobsen
IJRR
2008
100views more  IJRR 2008»
15 years 4 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...