Sciweavers

8322 search results - page 1599 / 1665
» What Are We Looking for
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 5 days ago
Branch, Cut, and Price: Sequential and Parallel
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...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
SIGOPSE
2000
ACM
14 years 22 hour ago
Congestion prices as feedback signals: an approach to QoS management
Recently there has been a renewed interest in the application of economic models to the management of computational resources. Most of this interest is focused on pricing models f...
Rolf Neugebauer, Derek McAuley
SIGSOFT
2000
ACM
14 years 22 hour ago
Implicit context: easing software evolution and reuse
Software systems should consist of simple, conceptually clean software components interacting along narrow, well-defined paths. All too often, this is not reality: complex compon...
Robert J. Walker, Gail C. Murphy
SIGUCCS
2000
ACM
14 years 21 hour ago
Supporting PeopleSoft in an Academic Environment: Pitbull or Poodle?
Over the past decade, distributed computing necessitated a centralized support environment at most colleges and universities. This development has given campus computer users the ...
Jen Whiting, Gary Eshbaugh
PADS
1999
ACM
13 years 12 months ago
Shock Resistant Time Warp
In an attempt to cope with time-varying workload, traditional adaptive Time Warp protocols are designed to react in response to performance changes by altering control parameter c...
Alois Ferscha, James Johnson
« Prev « First page 1599 / 1665 Last » Next »