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 29 matches
- 1997
- J. Adhikary, Geir Hasle, G. Misung:
Constraint Technology Applied to Forest Treatment Scheduling. PACT 1997: 15-34 - Jean-Marc Andreoli, Uwe M. Borghoff, Remo Pareschi:
Signed Feature Constraint Solving. PACT 1997: 35-46 - Roman Barták:
A Plug-In Architecture of Constraint Hierarchy Solvers. PACT 1997: 359-372 - Michael Baumgart, Hans Peter Kunz, Sascha Meyer, Klaus Quibeldey-Cirkel:
Priority-driven Constraints Used for Scheduling at Universities. PACT 1997: 65-74 - Hartwig Baumgärtel:
Distributed Constraint Processing for Production Logistics. PACT 1997: 75-90 - P. van Beek:
The Payoff Between Theory and Practice, or, What Can Theoreticians and Practitioners Learn From Each Other. PACT 1997: 5-6 - Eric Boucher, Astrid Bachelu, Christophe Varnier, Pierre Baptiste, Bruno Legeard:
Multi-criteria Comparison Between Algorithmic, Constraint Logic and Specific Constraint Programming on a Real Schedulingt Problem. PACT 1997: 47-64 - Volker Braun, Tiziana Margaria, Bernhard Steffen, Friedrich-Karl Bruhns:
Service Definition for Intelligent Networks: Experience in a Leading-edge Technological Project Based on Constraint Techniques. PACT 1997: 91-106 - Kam-Pui Chow, M. Perett:
Airport Counter Allocation Using Constraint Logic Programming. PACT 1997: 107-116 - Jana Dospisil, Elizabeth A. Kendall, Tony Polgar:
Multimedia Presentation Scheduling with ILOG. PACT 1997: 117-134 - R. Farfarakis, S. Hope:
The TOOCAn Approach. PACT 1997: 135-150 - Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano:
Constraint Logic Programming for the Crew Rostering Problem. PACT 1997: 151-164 - Thom W. Frühwirth, Pascal Brisset:
Optimal Planning of Digital Cordless Telecommunication Systems. PACT 1997: 165-176 - F. Glaisner, L.-M. Richard:
FORWARD_C: A Refinery Scheduling System. PACT 1997: 1-4 - Harald Meyer auf'm Hofe:
ConPlan/SIEDAplan: Personnel Assigment as a Problem of Hierarchical Constraint Satisfaction. PACT 1997: 257-272 - Bjørn Sigurd Johansen, Geir Hasle:
Well Activity Scheduling - An Application of Constraint Reasoning. PACT 1997: 177-192 - R. M. J. Jose, G. vom Scheidt, James F. Boyce:
Application of Connectionist Local Search to Line Management Rail Traffic Control. PACT 1997: 193-212 - Jürgen Kopsch, Petra Marx, Gisbert Lechner:
Modelling Engineering Design Knowledge with Constraints. PACT 1997: 213-224 - P. P. Laitinen:
Transfer Syntax Notation: A Language for the Development and Specification of Communication Protocols. PACT 1997: 225-236 - Claude Le Pape, Philippe Baptiste:
A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. PACT 1997: 237-256 - Mike Pegman, Nigel Forward, Brett King, Dave Teal:
Mine Planning and Scheduling at RTZ Technical Services. PACT 1997: 273-286 - Alexander L. Semenov, Tamara P. Kashevarova, Alexander S. Leshchenko, D. Petunin:
Combining Various Techniques with the Algorithm of Subdefinite Calculations. PACT 1997: 287-306 - Bernhard Seybold, Felix J. Metzger, G. Ogan, J. Bathelt, Fabian Collenberg, J. Taiber, Klaus Simon, M. Engeli:
Spatial Modelling with Geometric Constraints. PACT 1997: 307-320 - Igor Shvetsov, V. Kornienko, S. V. Preis:
Interval Spreadsheet for Problems of Financial Planning. PACT 1997: 373- - Barbara M. Smith:
Succeed-first or Fail-first: A Case Study in Variable and Value Ordering. PACT 1997: 321-330 - M. Takada, N. Kase, T. Terano:
Two Level CSP Approach to Production Scheduling for Medicine Packing Processes. PACT 1997: 331-338 - Mark Wallace:
How Constraint Logic Programming Unlocks Constraint Technology. PACT 1997: 7-14 - Tatyana M. Yakhno, V. Z. Zilberfain, Evgueni S. Petrov:
Applications of ECLiPSe: Interval Domain Library. PACT 1997: 339-358 - Mark Wallace:
Proceedings of the Third International Conference on the Practical Application of Constraint Technology, PACT 1997, Westminster Central Hall, London, UK, April 23-25, 1997. Practical Application Company Ltd. 1997, ISBN 0-9525554-4-1 [contents]
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-09-19 03:32 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