Sciweavers

9842 search results - page 173 / 1969
» Problem complexity
Sort
View
ANOR
2006
70views more  ANOR 2006»
15 years 2 months ago
Optimization problems in electron microscopy of single particles
Electron Microscopy is a valuable tool for the elucidation of the three-dimensional structure of macromolecular complexes. Knowledge about the macromolecular structure provides imp...
Carlos Oscar Sánchez Sorzano, Roberto Marab...
101
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 2 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
144
Voted
JCSS
2010
112views more  JCSS 2010»
15 years 23 days ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
100
Voted
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 7 months ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 2 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich