Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 1995
- Joseph Abate, Ward Whitt:
Numerical Inversion of Laplace Transforms of Probability Distributions. INFORMS J. Comput. 7(1): 36-43 (1995) - Thomas W. Archibald, K. I. M. McKinnon, Lyn C. Thomas:
Performance Issues for the Iterative Solution of Markov Decision Processes on Parallel Computers. INFORMS J. Comput. 7(3): 349-357 (1995) - Amit Basu:
Introduction to the Cluster on Knowledge and Data Management. INFORMS J. Comput. 7(3): 243 (1995) - Nils Jacob Berland:
Load Balancing in Hypercube Solution of Stochastic Optimization Problems. INFORMS J. Comput. 7(3): 358-364 (1995) - Kurt M. Bretthauer, Bala Shetty, Siddhartha Syam:
A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems. INFORMS J. Comput. 7(1): 109-116 (1995) - Dilip Chhajed, Vijay Chandru:
Hulls and Efficient Sets for the Rectilinear Norm. INFORMS J. Comput. 7(1): 78-83 (1995) - Joseph Czyzyk, Robert Fourer, Sanjay Mehrotra:
A Study of the Augmented System and Column-Splitting Approaches for Solving Two-Stage Stochastic Linear Programs by Interior-Point Methods. INFORMS J. Comput. 7(4): 474-490 (1995) - Mauro Dell'Amico, Silvano Martello:
Optimal Scheduling of Tasks on Identical Parallel Processors. INFORMS J. Comput. 7(2): 191-200 (1995) - Moustapha Diaby, R. Ramesh:
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach. INFORMS J. Comput. 7(1): 24-35 (1995) - Peter J. Downey:
Bounds and Approximations for Overheads in the Time to Join Parallel Forks. INFORMS J. Comput. 7(2): 125-139 (1995) - Jonathan Eckstein, I. Ilkay Boduroglu, Lazaros C. Polymenakos, Donald Goldfarb:
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2. INFORMS J. Comput. 7(4): 402-416 (1995) - Elizabeth A. Eschenbach, Christine A. Shoemaker, Hugh M. Caffey:
Parallel Algorithms for Stochastic Dynamic Programming with Continuous State and Control Variables. INFORMS J. Comput. 7(4): 386-401 (1995) - Robert Fourer, David M. Gay:
Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming. INFORMS J. Comput. 7(2): 166-190 (1995) - Fred W. Glover:
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories. INFORMS J. Comput. 7(4): 426-442 (1995) - Paulo B. Góes:
A Stochastic Model for Performance Evaluation of Main Memory Resident Database Systems. INFORMS J. Comput. 7(3): 269-282 (1995) - Ram D. Gopal, Ram Ramesh, Stanley Zionts:
Access Path Optimization in Relational Joins. INFORMS J. Comput. 7(3): 257-268 (1995) - Ananth Grama, Vipin Kumar:
Parallel Search Algorithms for Discrete Optimization Problems. INFORMS J. Comput. 7(4): 365-385 (1995) - Harvey J. Greenberg:
Analyzing the Pooling Problem. INFORMS J. Comput. 7(2): 205-217 (1995) - Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
On the Asymptotic Optimality of Multiprocessor Scheduling Heuristics for the Makespan Minimization Problem. INFORMS J. Comput. 7(2): 201-204 (1995) - A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove:
Single Machine Scheduling to Minimize Total Weighted Late Work. INFORMS J. Comput. 7(2): 232-242 (1995) - Jeffrey W. Herrmann, Chung-Yee Lee:
Solving a Class Scheduling Problem with a Genetic Algorithm. INFORMS J. Comput. 7(4): 443-452 (1995) - Daniel P. Heyman, Meredith J. Goldsmith:
Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain. INFORMS J. Comput. 7(1): 101-108 (1995) - T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao:
Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods. INFORMS J. Comput. 7(4): 417-425 (1995) - David L. Jagerman, Benjamin Melamed:
Spectral Analysis of Basic TES Processes. INFORMS J. Comput. 7(2): 140-148 (1995) - Lee K. Jones, Richard C. Larson:
Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference. INFORMS J. Comput. 7(1): 89-100 (1995) - Carsten Jordan, Andreas Drexl:
A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. INFORMS J. Comput. 7(2): 160-165 (1995) - George Kontoravdis, Jonathan F. Bard:
A GRASP for the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 7(1): 10-23 (1995) - Leon S. Lasdon, John C. Plummer, Gang Yu:
Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs. INFORMS J. Comput. 7(3): 321-332 (1995) - Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer:
Disjoint Paths in the Plane. INFORMS J. Comput. 7(1): 84-88 (1995) - R. Bruce Mattingly:
A Revised Stochastic Complementation Algorithm for Nearly Completely Decomposable Markov Chains. INFORMS J. Comput. 7(2): 117-124 (1995)
skipping 12 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-25 11:36 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint