Sciweavers

7430 search results - page 1031 / 1486
» Programming Applications in CIFF
Sort
View
204
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 7 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
190
Voted
CPHYSICS
2010
135views more  CPHYSICS 2010»
15 years 7 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
CORR
2008
Springer
102views Education» more  CORR 2008»
15 years 7 months ago
Spreadsheet modelling for solving combinatorial problems: The vendor selection problem
Spreadsheets have grown up and became very powerful and easy to use tools in applying analytical techniques for solving business problems. Operations managers, production managers...
Pandelis G. Ipsilandis
ENTCS
2010
96views more  ENTCS 2010»
15 years 7 months ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
172
Voted
EAAI
2008
101views more  EAAI 2008»
15 years 7 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
« Prev « First page 1031 / 1486 Last » Next »