Sciweavers

53327 search results - page 10600 / 10666
» is 2007
Sort
View
72
Voted
IOR
2007
65views more  IOR 2007»
15 years 14 days ago
A Comparison of the Optimal Costs of Two Canonical Inventory Systems
We compare two inventory systems, one in which excess demand is lost and the other in which excess demand is backordered. Both systems are reviewed periodically. They experience t...
Ganesh Janakiraman, Sridhar Seshadri, J. George Sh...
TCS
2008
15 years 14 days ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
89
Voted
IOR
2007
100views more  IOR 2007»
15 years 14 days ago
Competition in Service Industries
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...
Gad Allon, Awi Federgruen
106
Voted
IOR
2007
106views more  IOR 2007»
15 years 14 days ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
118
Voted
TCS
2008
15 years 14 days ago
Role-based access control for boxed ambients
Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the acad...
Adriana B. Compagnoni, Elsa L. Gunter, Philippe Bi...
« Prev « First page 10600 / 10666 Last » Next »