3946 search results - page 235 / 790 » The computational complexity of choice sets |
190
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
175
click to vote
TWC
2008
15 years 6 months ago
2008
Abstract-- We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller's classical feedback decoding...
191
click to vote
GROUP
1995
ACM
15 years 10 months ago
1995
ACM
Software and Information Systems (IS) documents are a common product of large IS development e orts. These documents are produced and consumed through a variety of documentation p...
154
click to vote
IPPS
2006
IEEE
16 years 21 days ago
2006
IEEE
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal st...
165
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...