6575 search results - page 656 / 1315 » Specializing visualization algorithms |
244
click to vote
WEA
2010
Springer
16 years 17 days ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
175
click to vote
DATE
2002
IEEE
16 years 12 days ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
215
click to vote
SIGECOM
2010
ACM
16 years 8 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
168
click to vote
ECRTS
1999
IEEE
15 years 11 months ago
1999
IEEE
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
194
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...