Sciweavers

11740 search results - page 361 / 2348
» More Problems in Rewriting
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 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...
155
Voted
AI
2006
Springer
15 years 6 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
EOR
2008
133views more  EOR 2008»
15 years 6 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
170
Voted
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 6 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
JUCS
2008
150views more  JUCS 2008»
15 years 6 months ago
Optimal Sensor Network Layout Using Multi-Objective Metaheuristics
: Wireless Sensor Networks (WSN) allow, thanks to the use of small wireless devices known as sensor nodes, the monitorization of wide and remote areas with precision and liveness u...
Guillermo Molina, Enrique Alba, El-Ghazali Talbi