15782 search results - page 3028 / 3157 » Network Optimization and Control |
140
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
119
click to vote
SIGCOMM
1999
ACM
15 years 7 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
147
Voted
DAC
1997
ACM
15 years 7 months ago
1997
ACM
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...
124
Voted
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
This paper describes the integration of the Berkeley Architectural Walkthrough Program with the National Institute of Standards and Technology’s CFAST fire simulator. The integ...
173
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...