Sciweavers

14 search results - page 1 / 3
» A Computational Study of Cost Reoptimization for Min-Cost Fl...
Sort
View
ICCAD
2003
IEEE
219views Hardware» more  ICCAD 2003»
14 years 2 months ago
A Min-Cost Flow Based Detailed Router for FPGAs
Routing for FPGAs has been a very challenging problem due to the limitation of routing resources. Although the FPGA routing problem has been researched extensively, most algorithm...
Seokjin Lee, Yongseok Cheon, Martin D. F. Wong
MP
1998
136views more  MP 1998»
13 years 5 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
HCI
2007
13 years 6 months ago
Reminders, Alerts and Pop-ups: The Cost of Computer-Initiated Interruptions
Responding to computer-initiated notifications requires a shift in attention that disrupts the flow of work. The degree of cost associated with resuming the original task following...
Helen M. Hodgetts, Dylan M. Jones
SIGMOD
2011
ACM
276views Database» more  SIGMOD 2011»
12 years 8 months ago
Schedule optimization for data processing flows on the cloud
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
Herald Kllapi, Eva Sitaridi, Manolis M. Tsangaris,...