Sciweavers

920 search results - page 88 / 184
» Generating Satisfiable Problem Instances
Sort
View
91
Voted
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
15 years 5 months ago
A Combinatorial Approach to Content-Based Music Selection
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
François Pachet, Pierre Roy, Daniel Cazaly
PPSN
1998
Springer
15 years 4 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
PVLDB
2010
97views more  PVLDB 2010»
14 years 11 months ago
Explaining Missing Answers to SPJUA Queries
This paper addresses the problem of explaining missing answers in queries that include selection, projection, join, union, aggregation and grouping (SPJUA). Explaining missing ans...
Melanie Herschel, Mauricio A. Hernández
97
Voted
AIR
2006
46views more  AIR 2006»
15 years 22 days ago
Spatial inference with geometric proportional analogies
Abstract We describe an instance-based reasoning solution to a variety of spatial reasoning problems. The solution centers on identifying an isomorphic mapping between labelled gra...
Emma-Claire Mullally, Diarmuid P. O'Donoghue
82
Voted
JUCS
2007
98views more  JUCS 2007»
15 years 17 days ago
Random k-GD-Sat Model and its Phase Transition
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...