Sciweavers

1160 search results - page 73 / 232
» Applying Constraint Solving to the Management of Distributed...
Sort
View
ISCIS
2009
Springer
15 years 10 months ago
Channel assignment problem in cellular networks: A reactive tabu search approach
—The channel assignment problem (CAP) in cellular networks is concerned with the allocation and reuse of the frequency spectrum to the base stations in such a way that both the i...
Didem Gözüpek, Gaye Genç, Cem Ers...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 4 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...
ICCBR
2003
Springer
15 years 9 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings
KCAP
2009
ACM
15 years 10 months ago
Workflow matching using semantic metadata
Workflows are becoming an increasingly more common paradigm to manage scientific analyses. As workflow repositories start to emerge, workflow retrieval and discovery becomes a cha...
Yolanda Gil, Jihie Kim, Gonzalo Flórez Puga...
RTSS
2005
IEEE
15 years 9 months ago
Improving Soft Real-Time Performance through Better Slack Reclaiming
Modern operating systems frequently support applications with a variety of timing constraints including hard real-time, soft real-time, and best-effort. To guarantee performance, ...
Caixue Lin, Scott A. Brandt