Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
15
views
15
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,973
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Principles and Practice of Constraint Programming
An Application of Constraint Programming to Superblock Instruction Scheduling
other
Author(s):
Abid M. Malik
,
Michael Chase
,
Tyrel Russell
,
Peter van Beek
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Most cited references
15
Record
: found
Abstract
: not found
Book Chapter
: not found
Impact-Based Search Strategies for Constraint Programming
Philippe Refalo
(2004)
0
comments
Cited
21
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Heavy-tailed distributions in combinatorial search
Carla Gomes
,
Bart Selman
,
Nuno Crato
(1997)
0
comments
Cited
20
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Postpass Code Optimization of Pipeline Constraints
Thomas Gross
,
John Hennessy
(1983)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2008
Pages
: 97-111
DOI:
10.1007/978-3-540-85958-1_7
SO-VID:
920accc4-314c-4973-b87c-8c5120f7a538
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Back to the Complexity of Universal Programs
pp. 21
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
pp. 36
Planning and Scheduling the Operation of a Very Large Oil Pipeline Network
pp. 52
Search Strategies for Rectangle Packing
pp. 67
Solving a Telecommunications Feature Subscription Configuration Problem
pp. 82
Protein Structure Prediction with Large Neighborhood Constraint Programming Search
pp. 97
An Application of Constraint Programming to Superblock Instruction Scheduling
pp. 112
Classes of Submodular Constraints Expressible by Graph Cuts
pp. 128
Optimization of Simple Tabular Reduction for Table Constraints
pp. 144
Universal Booleanization of Constraint Models
pp. 159
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
pp. 175
Guiding Search in QCSP + with Back-Propagation
pp. 190
A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
pp. 205
A Branch and Bound Algorithm for Numerical MAX-CSP
pp. 220
A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
pp. 235
Cost-Based Domain Filtering for Stochastic Constraint Programming
pp. 251
Dichotomic Search Protocols for Constrained Optimization
pp. 266
Length-Lex Bounds Consistency for Knapsack Constraints
pp. 282
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
pp. 298
From High Girth Graphs to Hard Instances
pp. 313
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
pp. 327
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
pp. 342
Exploiting Common Subexpressions in Numerical CSPs
pp. 358
A Soft Constraint of Equality: Complexity and Approximability
pp. 372
Structural Tractability of Propagated Constraints
pp. 387
Connecting ABT with Arc Consistency
pp. 402
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
pp. 418
Reformulating Positive Table Constraints Using Functional Dependencies
pp. 433
Relaxations for Compiled Over-Constrained Problems
pp. 448
Approximate Compilation of Constraints into Multivalued Decision Diagrams
pp. 463
Quantified Constraint Optimization
pp. 478
Exploiting Decomposition in Constraint Optimization Problems
pp. 493
A Coinduction Rule for Entailment of Recursively Defined Properties
pp. 509
Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
pp. 524
Perfect Constraints Are Tractable
pp. 529
Efficiently Solving Problems Where the Solutions Form a Group
pp. 534
Approximate Solution Sampling (and Counting) on AND/OR Spaces
pp. 539
Model Restarts for Structural Symmetry Breaking
pp. 545
An Elimination Algorithm for Functional Constraints
pp. 550
Crossword Puzzles as a Constraint Problem
pp. 555
Recent Hybrid Techniques for the Multi-Knapsack Problem
pp. 560
Edge Matching Puzzles as Hard SAT/CSP Benchmarks
pp. 566
Test Strategy Generation Using Quantified CSPs
pp. 571
Perfect Derived Propagators
pp. 576
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
pp. 582
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation
pp. 588
Semi-automatic Generation of CHR Solvers for Global Constraints
pp. 593
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions
pp. 598
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
pp. 603
Computing All Optimal Solutions in Satisfiability Problems with Preferences
pp. 608
On the Efficiency of Impact Based Heuristics
pp. 613
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
pp. 618
A New Empirical Study of Weak Backdoors
pp. 624
Adding Search to Zinc
pp. 630
Experimenting with Small Changes in Conflict-Driven Clause Learning Algorithms
pp. 635
Search Space Reduction for Constraint Optimization Problems
pp. 640
Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence Problem
Similar content
3,973
Effects of Superblocks on health and health inequities: a proposed evaluation framework
Authors:
Roshanak Mehdipanah
,
Ana Novoa
,
Brenda Biaani León-Gómez
…
Crafting a planning issue with citizens in the context of planning competition: a case of ‘Nordic Superblock’
Authors:
J. Sjöblom
,
J. Kuoppa
,
M. LAINE
…
Compact Storage of Superblocks for NIPoPoW Applications
Authors:
Kostis Karantias
,
Aggelos Kiayias
,
Dionysis Zindros
See all similar
Cited by
2
Constraint-Based Register Allocation and Instruction Scheduling
Authors:
Roberto Castañeda Lozano
,
Mats Carlsson
,
Frej Drejhammar
…
Combinatorial Register Allocation and Instruction Scheduling
Authors:
Gabriel Blindell
,
Roberto Lozano
,
Christian Schulte
…
See all cited by