1568 search results - page 255 / 314 » The problem of examination questions in algorithmics |
138
click to vote
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
159
click to vote
INFORMS
1998
15 years 3 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
132
click to vote
COR
2007
15 years 3 months ago
2007
We studied a supplier selection problem, where a buyer, while facing random demand, is to decide ordering quantities from a set of suppliers with different yields and prices.We pr...
150
click to vote
ORL
2006
15 years 3 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
137
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...