Sciweavers

169 search results - page 33 / 34
» The Workarounds Process as a Source of Knowledge Creation an...
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 9 months 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...
SIGMOD
2007
ACM
188views Database» more  SIGMOD 2007»
14 years 5 months ago
Keyword search on relational data streams
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
Alexander Markowetz, Yin Yang, Dimitris Papadias
ICS
2007
Tsinghua U.
13 years 11 months ago
Optimization and bottleneck analysis of network block I/O in commodity storage systems
Building commodity networked storage systems is an important architectural trend; Commodity servers hosting a moderate number of consumer-grade disks and interconnected with a hig...
Manolis Marazakis, Vassilis Papaefstathiou, Angelo...
SIGSOFT
2006
ACM
13 years 11 months ago
Memories of bug fixes
The change history of a software project contains a rich collection of code changes that record previous development experience. Changes that fix bugs are especially interesting, ...
Sunghun Kim, Kai Pan, E. James Whitehead Jr.
SIGCOMM
2004
ACM
13 years 10 months ago
A wavelet-based approach to detect shared congestion
Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion manag...
Min Sik Kim, Taekhyun Kim, YongJune Shin, Simon S....