1022 search results - page 191 / 205 » Challenges for Constraint Programming in Networking |
118
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
99
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
SIGCOMM
2009
ACM
15 years 7 months ago
2009
ACM
New protocols for the data link and network layer are being proposed to address limitations of current protocols in terms of scalability, security, and manageability. High-speed r...
101
Voted
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
103
Voted
CHI
2005
ACM
16 years 25 days ago
2005
ACM
This workshop aims to gather researchers in the field of user interface design tools to identify important themes for the next decade of research. These tools aid in the design an...