Sciweavers

2089 search results - page 55 / 418
» A New Problem in String Searching
Sort
View
AIMSA
2008
Springer
15 years 4 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
IRI
2006
IEEE
15 years 3 months ago
A new heuristic-based albeit complete method to extract MUCs from unsatisfiable CSPs
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
Éric Grégoire, Bertrand Mazure, C&ea...
MP
2006
137views more  MP 2006»
14 years 9 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
AHS
2007
IEEE
210views Hardware» more  AHS 2007»
15 years 4 months ago
Evaluation of a New Platform For Image Filter Evolution
This paper describes a new FPGA implementation of a system for evolutionary image filter design. Three parallel search algorithms are compared. An optimal mutation rate and the q...
Zdenek Vasícek, Lukás Sekanina
FLAIRS
2004
14 years 11 months ago
A New Algorithm for Singleton Arc Consistency
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
Roman Barták, Radek Erben