Sciweavers

226 search results - page 21 / 46
» GAC on Conjunctions of Constraints
Sort
View
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 7 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
AAAI
1996
13 years 8 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
PE
2000
Springer
175views Optimization» more  PE 2000»
13 years 7 months ago
Credit-based source-adaptive multilayered video multicast
Spatial and temporal variations in network bandwidth constraints constitute serious challenges to the multicast distribution of real-time video content. This paper presents a vide...
Célio Albuquerque, Brett J. Vickers, Tatsuy...
CIKM
2011
Springer
12 years 7 months ago
Semantic data markets: a flexible environment for knowledge management
We present Nyaya, a system for the management of Semantic-Web data which couples a general-purpose and extensible storage mechanism with efficient ontology reasoning and querying ...
Roberto De Virgilio, Giorgio Orsi, Letizia Tanca, ...