3250 search results - page 397 / 650 » An Algorithm to Solve a Linear Program |
166
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
150
click to vote
DAC
2009
ACM
16 years 1 months ago
2009
ACM
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
179
click to vote
JAIR
2011
15 years 1 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
194
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
214
click to vote
SOCC
2008
IEEE
16 years 29 days ago
2008
IEEE
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...