Sciweavers

2412 search results - page 83 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ICCAD
2002
IEEE
154views Hardware» more  ICCAD 2002»
16 years 22 hour ago
Concurrent flip-flop and repeater insertion for high performance integrated circuits
For many years, CMOS process scaling has allowed a steady increase in the operating frequency and integration density of integrated circuits. Only recently, however, have we reach...
Pasquale Cocchini
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 9 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
TAPSOFT
1991
Springer
15 years 6 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 3 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 3 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous