Sciweavers

914 search results - page 9 / 183
» Branch and Bound on the Network Model
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
13 years 7 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 12 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...
WCET
2008
13 years 8 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
LAWEB
2005
IEEE
14 years 29 days ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
ASIAN
2005
Springer
96views Algorithms» more  ASIAN 2005»
14 years 28 days ago
Query Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan