Остановите войну!
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 31 matches
- 2004
- Matthew Andrews, Lisa Zhang:
Scheduling Protocols for Switches with Large Envelopes. J. Sched. 7(3): 171-186 (2004) - Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza:
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7(6): 421-428 (2004) - Sanjeev Arora, Bo Brinkman:
A Randomized Online Algorithm for Bandwidth Utilization. J. Sched. 7(3): 187-194 (2004) - Laura Barbulescu, Jean-Paul Watson, L. Darrell Whitley, Adele E. Howe:
Scheduling Space-Ground Communications for the Air Force Satellite Control Network. J. Sched. 7(1): 7-34 (2004) - Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Approximation Algorithms for Average Stretch Scheduling. J. Sched. 7(3): 195-222 (2004) - Gary W. Black, Kenneth N. McKay, Sherri L. Messimer:
Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling. J. Sched. 7(4): 277-292 (2004) - Edgar den Boef, Wim F. J. Verhaegh, Jan H. M. Korst:
Bus and Buffer Usage in In-Home Digital Networks: Applying the Dantzig-Wolfe Decomposition. J. Sched. 7(2): 119-131 (2004) - Reinder J. Bril, Elisabeth F. M. Steffens, Wim F. J. Verhaegh:
Best-Case Response Times and Jitter Analysis of Real-Time Tasks. J. Sched. 7(2): 133-147 (2004) - Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe, Hendrik Van Landeghem:
The State of the Art of Nurse Rostering. J. Sched. 7(6): 441-499 (2004) - Edmund K. Burke, Michael L. Pinedo, Steef L. van de Velde:
Editorial. J. Sched. 7(1): 5 (2004) - Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos:
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. J. Sched. 7(1): 85-91 (2004) - Peter Damaschke:
Scheduling Search Procedures. J. Sched. 7(5): 349-364 (2004) - Stéphane Dauzère-Pérès, Marc Sevaux:
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling. J. Sched. 7(6): 405-420 (2004) - Erik Demeulemeester:
Book Review/Project Scheduling with Time Windows and Scarce Resources by Klaus Neumann, Christoph Schwindt and Jürgen Zimmermann. J. Sched. 7(6): 501-502 (2004) - Thomas Erlebach, Alexander Hall:
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Sched. 7(3): 223-241 (2004) - Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. J. Sched. 7(5): 365-374 (2004) - H. Neil Geismar, Milind Dawande, Chelliah Sriskandarajah:
Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells. J. Sched. 7(5): 375-395 (2004) - Nicholas G. Hall, Marc E. Posner:
Sensitivity Analysis for Scheduling Problems. J. Sched. 7(1): 49-83 (2004) - Han Hoogeveen:
Book Review. J. Sched. 7(1): 93-94 (2004) - Sandy Irani, Xiangwen Lu, Amelia Regan:
On-Line Algorithms for the Dynamic Traveling Repair Problem. J. Sched. 7(3): 243-258 (2004) - Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. J. Sched. 7(1): 35-48 (2004) - John J. Kanet, Xiaoming Li:
A Weighted Modified Due Date Rule for Sequencing to Minimize Weighted Tardiness. J. Sched. 7(4): 261-276 (2004) - Zhaohui Liu, T. C. Edwin Cheng:
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties. J. Sched. 7(4): 313-327 (2004) - Dirk C. Mattfeld:
Conference Diary. J. Sched. 7(5): 397-399 (2004) - Hiroyuki Miyazawa, Thomas Erlebach:
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. J. Sched. 7(4): 293-311 (2004) - Sai Shankar N.:
A New Contention Resolution Procedure for HFC Access Networks and its Performance Evaluation. J. Sched. 7(2): 149-167 (2004) - Vincent T'kindt, Federico Della Croce, Carl Esswein:
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. J. Sched. 7(6): 429-440 (2004) - Clemens C. Wüst, Wim F. J. Verhaegh:
Quality Control for Scalable Media Processing Applications. J. Sched. 7(2): 105-117 (2004) - SCHARM'01: Selected Papers from the 2nd Philips Research Workshop on Scheduling and Resource Management. J. Sched. 7(2): 103-104 (2004)
- Editorial. J. Sched. 7(3): 169 (2004)
skipping 1 more match
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-05-16 18:37 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