Sciweavers

2089 search results - page 101 / 418
» A New Problem in String Searching
Sort
View
CSCLP
2004
Springer
15 years 1 months ago
Constraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
EOR
2010
110views more  EOR 2010»
14 years 10 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
ER
2009
Springer
111views Database» more  ER 2009»
15 years 4 months ago
A New Point Access Method Based on Wavelet Trees
Abstract. The development of index structures that allow ecient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been d...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
CSB
2003
IEEE
15 years 3 months ago
A New Approach for Gene Annotation Using Unambiguous Sequence Joining
The problem addressed by this paper is accurate and automatic gene annotation following precise identification/annotation of exon and intron boundaries of biologically verified ...
Alexandre Tchourbanov, Daniel Quest, Hesham H. Ali...
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 1 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos