Sciweavers

247 search results - page 13 / 50
» Combining Adaptive and Dynamic Local Search for Satisfiabili...
Sort
View
CP
2005
Springer
14 years 1 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
ESANN
2007
13 years 9 months ago
A novel kernel-based method for local pattern extraction in random process signals
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
Majid Beigi, Andreas Zell
ICSE
2004
IEEE-ACM
14 years 7 months ago
Dynamic Configuration of Resource-Aware Services
An important emerging requirement for computing systems is the ability to adapt at run time, taking advantage of local computing devices, and coping with dynamically changing reso...
David Garlan, João Pedro Sousa, Mary Shaw, ...
AUTOMATICA
2008
126views more  AUTOMATICA 2008»
13 years 7 months ago
Local stability analysis using simulations and sum-of-squares programming
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
Ufuk Topcu, Andrew K. Packard, Peter Seiler
EOR
2010
119views more  EOR 2010»
13 years 7 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao