3244 search results - page 152 / 649 » On convex complexity measures |
141
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
SIGOPSE
2004
ACM
15 years 7 months ago
2004
ACM
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
124
click to vote
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
107
Voted
HICSS
2002
IEEE
15 years 6 months ago
2002
IEEE
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...