13 search results - page 2 / 3 » Branch and bound computation of exact p-values |
AAAI
2004
13 years 7 months ago
2004
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
APN
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
NETWORKS
2008
13 years 5 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
RTSS
2005
IEEE
13 years 11 months ago
2005
IEEE
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...