2313 search results - page 115 / 463 » On Heuristic Time Hierarchies |
185
click to vote
EOR
2002
15 years 6 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
204
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
145
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
138
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents a very efficient algorithm for performance-driven topology design for interconnects. Given a net, it first generates A-tree1 topology using table lookup and net...
171
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...