2398 search results - page 296 / 480 » Constraint Programming and Graph Algorithms |
169
Voted
ASPDAC
2006
ACM
16 years 9 days ago
2006
ACM
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
190
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
170
Voted
LCTRTS
2010
Springer
16 years 1 months ago
2010
Springer
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
165
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...