Sciweavers

1263 search results - page 22 / 253
» A* with Bounded Costs
Sort
View
ECRTS
2002
IEEE
15 years 2 months ago
Managing Multi-Mode Tasks with Time Cost and Quality Levels using Optimal Discrete Control Synthesis
Real-time control systems are complex to design, and automation support is important. We are interested in systems with multiple tasks, each with multiple modes, implementing a fu...
Hervé Marchand, Éric Rutten
72
Voted
EOR
2008
91views more  EOR 2008»
14 years 9 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
83
Voted
CP
2007
Springer
15 years 3 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
SIROCCO
2003
14 years 11 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
COR
2007
106views more  COR 2007»
14 years 9 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk