Sciweavers

13376 search results - page 58 / 2676
» Problem Solving with
Sort
View
CP
2005
Springer
15 years 6 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
121
Voted
COCOA
2009
Springer
15 years 7 months ago
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong ...
JAIR
2008
121views more  JAIR 2008»
15 years 21 days ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
99
Voted
IEEEARES
2010
IEEE
15 years 7 months ago
Solving the Transitive Access Problem for the Services Oriented Architecture
: © Solving the Transitive Access Problem for the Services Oriented Architecture Alan H. Karp, Jun Li HP Laboratories HPL-2008-204R1 SOA, web services, access control, RBAC, PBAC,...
Alan H. Karp, Jun Li
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 6 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...